default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 449
Volume 449, August 2012
- Markus Holzer
, Martin Kutrib, Giovanni Pighizzini:
Preface. 1
- Paolo Baldan, Alessandro Bruni, Andrea Corradini, Barbara König, César Rodríguez, Stefan Schwoon:
Efficient unfolding of contextual Petri nets. 2-22 - Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano:
The size-cost of Boolean operations on constant height deterministic pushdown automata. 23-36 - Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. 37-53 - Jean-Marc Champarnaud, Jean-Philippe Dubernard, Franck Guingne, Hadrien Jeanne:
Geometrical regular languages and linear Diophantine equations: The strongly connected case. 54-63 - Jürgen Dassow, Florin Manea, Bianca Truthe:
On external contextual grammars with subregular selection languages. 64-73 - Oscar H. Ibarra, Nicholas Q. Trân:
On synchronized multi-tape and multi-head automata. 74-84 - Galina Jirásková, Juraj Sebej:
Reversal of binary regular languages. 85-92 - Galina Jirásková, Tomás Masopust:
On a structural property in the state complexity of projected regular languages. 93-105 - Michal Kunc, Alexander Okhotin:
State complexity of operations on two-way finite automata over a unary alphabet. 106-118 - Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Descriptional complexity of two-way pushdown automata with restricted head reversals. 119-133 - Sherzod Turaev, Jürgen Dassow, Florin Manea, Mohd Hasan Selamat:
Language classes generated by tree controlled grammars with bounded nonterminal complexity. 134-144
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.
last updated on 2024-09-21 01:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
