default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs449.bht:"
@article{DBLP:journals/tcs/BaldanBCKRS12, author = {Paolo Baldan and Alessandro Bruni and Andrea Corradini and Barbara K{\"{o}}nig and C{\'{e}}sar Rodr{\'{\i}}guez and Stefan Schwoon}, title = {Efficient unfolding of contextual Petri nets}, journal = {Theor. Comput. Sci.}, volume = {449}, pages = {2--22}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.046}, doi = {10.1016/J.TCS.2012.04.046}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BaldanBCKRS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BednarovaGMP12, author = {Zuzana Bedn{\'{a}}rov{\'{a}} and Viliam Geffert and Carlo Mereghetti and Beatrice Palano}, title = {The size-cost of Boolean operations on constant height deterministic pushdown automata}, journal = {Theor. Comput. Sci.}, volume = {449}, pages = {23--36}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.05.009}, doi = {10.1016/J.TCS.2012.05.009}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BednarovaGMP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BrzozowskiLY12, author = {Janusz A. Brzozowski and Baiyu Li and Yuli Ye}, title = {Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages}, journal = {Theor. Comput. Sci.}, volume = {449}, pages = {37--53}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.011}, doi = {10.1016/J.TCS.2012.04.011}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BrzozowskiLY12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ChamparnaudDGJ12, author = {Jean{-}Marc Champarnaud and Jean{-}Philippe Dubernard and Franck Guingne and Hadrien Jeanne}, title = {Geometrical regular languages and linear Diophantine equations: The strongly connected case}, journal = {Theor. Comput. Sci.}, volume = {449}, pages = {54--63}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.012}, doi = {10.1016/J.TCS.2012.04.012}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChamparnaudDGJ12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DassowMT12, author = {J{\"{u}}rgen Dassow and Florin Manea and Bianca Truthe}, title = {On external contextual grammars with subregular selection languages}, journal = {Theor. Comput. Sci.}, volume = {449}, pages = {64--73}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.008}, doi = {10.1016/J.TCS.2012.04.008}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DassowMT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HolzerKP12, author = {Markus Holzer and Martin Kutrib and Giovanni Pighizzini}, title = {Preface}, journal = {Theor. Comput. Sci.}, volume = {449}, pages = {1}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.06.025}, doi = {10.1016/J.TCS.2012.06.025}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/HolzerKP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/IbarraT12, author = {Oscar H. Ibarra and Nicholas Q. Tr{\^{a}}n}, title = {On synchronized multi-tape and multi-head automata}, journal = {Theor. Comput. Sci.}, volume = {449}, pages = {74--84}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.006}, doi = {10.1016/J.TCS.2012.04.006}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/IbarraT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/JiraskovaM12, author = {Galina Jir{\'{a}}skov{\'{a}} and Tom{\'{a}}s Masopust}, title = {On a structural property in the state complexity of projected regular languages}, journal = {Theor. Comput. Sci.}, volume = {449}, pages = {93--105}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.009}, doi = {10.1016/J.TCS.2012.04.009}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/JiraskovaM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/JiraskovaS12, author = {Galina Jir{\'{a}}skov{\'{a}} and Juraj Sebej}, title = {Reversal of binary regular languages}, journal = {Theor. Comput. Sci.}, volume = {449}, pages = {85--92}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.05.008}, doi = {10.1016/J.TCS.2012.05.008}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/JiraskovaS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KuncO12, author = {Michal Kunc and Alexander Okhotin}, title = {State complexity of operations on two-way finite automata over a unary alphabet}, journal = {Theor. Comput. Sci.}, volume = {449}, pages = {106--118}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.010}, doi = {10.1016/J.TCS.2012.04.010}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KuncO12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MalcherMP12, author = {Andreas Malcher and Carlo Mereghetti and Beatrice Palano}, title = {Descriptional complexity of two-way pushdown automata with restricted head reversals}, journal = {Theor. Comput. Sci.}, volume = {449}, pages = {119--133}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.007}, doi = {10.1016/J.TCS.2012.04.007}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/MalcherMP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/TuraevDMS12, author = {Sherzod Turaev and J{\"{u}}rgen Dassow and Florin Manea and Mohd Hasan Selamat}, title = {Language classes generated by tree controlled grammars with bounded nonterminal complexity}, journal = {Theor. Comput. Sci.}, volume = {449}, pages = {134--144}, year = {2012}, url = {https://doi.org/10.1016/j.tcs.2012.04.013}, doi = {10.1016/J.TCS.2012.04.013}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/TuraevDMS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.