M. S. BALAN:
Complexity Measures for Binding-Blocking Automata.
Journal of Automata, Languages and Combinatorics 13
(2008) 2, 105–123.
-
B. BORCHERT:
Formal Language Characterizations of P, NP, and PSPACE.
Journal of Automata, Languages and Combinatorics 13 (2008)
3/4, 161–183.
-
F. D'ALESSANDRO,
S. VARRICCHIO:
On the Growth of Context-Free Languages.
Journal of
Automata, Languages and Combinatorics 13 (2008) 2, 95–104.
-
M. DALEY, M. ERAMIAN, I. MCQUILLAN:
The Bag
Automaton: A Model of Nondeterministic Storage.
Journal of Automata, Languages and Combinatorics 13 (2008) 3/4,
185–206.
-
R. DE SOUZA, N. KOBAYASHI:
A
Combinatorial Study of k-Valued Rational Relations.
Journal of Automata, Languages and Combinatorics 13 (2008) 3/4,
207–231.
-
S. Z. FAZEKAS,
B. NAGY:
Scattered Subword Complexity of non-Primitive Words.
Journal of Automata, Languages and Combinatorics 13 (2008) 3/4,
233–247.
-
Z. FÜLÖP, L. MUZAMEL:
Circularity, Composition, and Decomposition Results for Pebble Macro Tree
Transducers.
Journal of Automata, Languages and
Combinatorics 13 (2008) 1, 3–44.
-
M. KAMBITES, F. OTTO:
Church-Rosser
Groups and Growing Context-Sensitive Groups.
Journal
of Automata, Languages and Combinatorics 13 (2008) 3/4,
249–267.
-
S. KITAEV, A. PYATKIN:
On
Representable Graphs.
Journal of Automata, Languages
and Combinatorics 13 (2008) 1, 45–54.
-
S. KONSTANTINIDIS, P. V. SILVA:
Maximal Error-Detecting Capabilities of Formal Languages.
Journal of Automata, Languages and Combinatorics 13
(2008) 1, 55–71.
-
Z.-Z. LI, H.-J. SHYR, Y.-S. TSAI:
Automata Accepting Bifix Codes.
Journal of
Automata, Languages and Combinatorics 13 (2008) 3/4,
269–297.
-
V. V. LOZIN:
Graph Representation Functions Computable by Finite
Automata.
Journal of Automata, Languages and
Combinatorics 13 (2008) 1, 73–90.
-
A. OKHOTIN:
Homomorphisms Preserving Linear Conjunctive Languages.
Journal of Automata, Languages and Combinatorics 13 (2008) 3/4,
299–305.
-
M. V. P. RAO, V. VINAY:
Quantum Finite Automata and Weighted Automata.
Journal of Automata, Languages and Combinatorics 13 (2008) 2,
125–139.
-
A. ROMAN:
A Note
on Cerny Conjecture for Automata over 3-Letter Alphabet.
Journal of Automata, Languages and Combinatorics 13
(2008) 2, 141–143.
-
I. TOMESCU:
Threshold Properties of Some Periodic Factors of Words over a Finite
Alphabet.
Journal of Automata, Languages and
Combinatorics 13 (2008) 2, 145–156.
|
