default search action
Journal of Automata, Languages and Combinatorics, Volume 13
Volume 13, Number 1, 2008
- Zoltán Fülöp, Lorand Muzamel:
Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers. 3-44 - Sergey Kitaev, Artem V. Pyatkin:
On Representable Graphs. 45-54 - Stavros Konstantinidis, Pedro V. Silva:
Maximal Error-Detecting Capabilities of Formal Languages. 55-71 - Vadim V. Lozin:
Graph Representation Functions Computable by Finite Automata. 73-90
Volume 13, Number 2, 2008
- Flavio D'Alessandro, Stefano Varricchio:
On the Growth of Context-Free Languages. 95-104 - M. Sakthi Balan:
Complexity Measures for Binding-Blocking Automata. 105-123 - M. V. Panduranga Rao, V. Vinay:
Quantum Finite Automata and Weighted Automata. 125-139 - Adam Roman:
A Note on Černý Conjecture for Automata over 3-Letter Alphabet. 141-143 - Ioan Tomescu:
Threshold Properties of Some Periodic Factors of Words over a Finite Alphabet. 145-156
Volume 13, Number 3/4, 2008
- Bernd Borchert:
Formal Language Characterizations of P, NP, and PSPACE. 161-183 - Mark Daley, Mark G. Eramian, Ian McQuillan:
The Bag Automaton: A Model of Nondeterministic Storage. 185-206 - Rodrigo de Souza, Nami Kobayashi:
A Combinatorial Study of k-Valued Rational Relations. 207-231 - Szilárd Zsolt Fazekas, Benedek Nagy:
Scattered Subword Complexity of non-Primitive Words. 233-247 - Mark Kambites, Friedrich Otto:
Church-Rosser Groups and Growing Context-Sensitive Groups. 249-267 - Zheng-Zhu Li, Huei-Jan Shyr, Yen-Shung Tsai:
Automata Accepting Bifix Codes. 269-297 - Alexander Okhotin:
Homomorphisms Preserving Linear Conjunctive Languages. 299-305
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.