H. BORDIHN, M. HOLZER, M. KUTRIB:
Economy of Description for Basic
Constructions on Rational Transductions.
Journal of
Automata, Languages and Combinatorics 9 (2004) 2/3, 175–188.
-
C. CÂMPEANU, W. H. HO:
The Maximum State Complexity for Finite Languages.
Journal of Automata, Languages and Combinatorics 9 (2004) 2/3,
189–202.
-
J.-M. CHAMPARNAUD, G. HANSEL, T. PARANTHOËN, D. ZIADI:
Random Generation Models for
NFAs.
Journal of Automata, Languages and
Combinatorics 9 (2004) 2/3, 203–216.
-
M. DOMARATZKI, K. SALOMAA:
State
Complexity of Shuffle on Trajectories.
Journal of
Automata, Languages and Combinatorics 9 (2004) 2/3, 217–232.
-
K. ELLUL, B. KRAWETZ, J. SHALLIT, M.-W. WANG:
Regular
Expressions: New Results and Open Problems.
Journal of
Automata, Languages and Combinatorics 9 (2004) 2/3, 233–256.
-
M. G. ERAMIAN:
Efficient Simulation of
Nondeterministic Weighted Finite Automata.
Journal of
Automata, Languages and Combinatorics 9 (2004) 2/3, 257–267.
-
Z. ÉSIK, Z. L. NÉMETH:
Higher Dimensional Automata.
Journal of
Automata, Languages and Combinatorics 9 (2004) 1, 3–29.
-
R. FREUND, M. OSWALD:
P Systems
with Conditional Communication Rules Assigned to Membranes.
Journal of Automata, Languages and Combinatorics 9 (2004) 4,
387–397.
-
Z. FÜLÖP, H. VOGLER:
Weighted
Tree Transducers.
Journal of Automata, Languages and
Combinatorics 9 (2004) 1, 31–54.
-
F. GÉCSEG, B. IMREH:
On Definite
and Nilpotent DR Tree Languages.
Journal of Automata,
Languages and Combinatorics 9 (2004) 1, 55–60.
-
C. GROZEA:
NP
Predicates Computable in the Weakest Level of the Grzegorczyck
Hierarchy.
Journal of Automata, Languages and
Combinatorics 9 (2004) 2/3, 269–279.
-
G. GUAIANA, A. RESTIVO, S. SALEMI:
On the Trace Product and some
Families of Languages Closed under Partial Commutations.
Journal of Automata, Languages and Combinatorics 9 (2004) 1,
61–79.
-
H. JÜRGENSEN, S. KONSTANTINIDIS, N. H. LÂM:
Asymptotically Optimal Low-Cost Solid Codes.
Journal of Automata, Languages and Combinatorics 9 (2004) 1,
81–102.
-
M. KAPPES, C. M. R. KINTALA:
Tradeoffs Between Reliability and
Conciseness of Deterministic Finite Automata.
Journal
of Automata, Languages and Combinatorics 9 (2004) 2/3,
281–292.
-
L. KARI, S. KONSTANTINIDIS:
Descriptional Complexity of Error/Edit Systems.
Journal of Automata, Languages and Combinatorics 9 (2004) 2/3,
293–309.
-
S. KITAEV, T. MANSOUR, P. SÉÉBOLD:
Generating the Peano Curve and
Counting Occurrences of some Patterns.
Journal of
Automata, Languages and Combinatorics 9 (2004) 4, 439–455.
-
M. LATTEUX:
Valence Languages Generated by Equality Sets.
Journal of Automata, Languages and Combinatorics 9 (2004) 4,
399–406.
-
M. MADHU:
Descriptional Complexity of Rewriting P Systems.
Journal of Automata, Languages and Combinatorics 9 (2004) 2/3,
311–316.
-
M. MADHU, K. KRITHIVASAN:
Length
Synchronization Context-Free Grammars.
Journal of
Automata, Languages and Combinatorics 9 (2004) 4, 457–464.
-
I. MCQUILLAN:
Descriptional Complexity of
Block-Synchronization Context-Free Grammars.
Journal
of Automata, Languages and Combinatorics 9 (2004) 2/3,
317–332.
-
C. MILLER:
Context
Derivation Sets and Context-Free Normal Forms.
Journal
of Automata, Languages and Combinatorics 9 (2004) 2/3,
333–345.
-
J. NÉRAUD, C. SELMI:
A
Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of
A*.
Journal of Automata, Languages and
Combinatorics 9 (2004) 1, 103–110.
-
F. NIESSNER:
Büchi Automata and Their Degrees of Nondeterminism and
Ambiguity.
Journal of Automata, Languages and
Combinatorics 9 (2004) 2/3, 347–363.
-
A. OKHOTIN:
State
Complexity of Linear Conjunctive Grammars.
Journal of
Automata, Languages and Combinatorics 9 (2004) 2/3, 365–381.
-
F. OTTO:
Some
Results on RWW- and RRWW-Automata and their Relation to the Class of Growing
Context-Sensitive Languages.
Journal of Automata,
Languages and Combinatorics 9 (2004) 4, 407–437.
-
Y. SAKAKIBARA, H. IMAI:
A DNA-Based
Computational Model Using a Specific Type of Restriction Enzymes.
Journal of Automata, Languages and Combinatorics 9
(2004) 1, 111–119.
-
N. SANTEAN:
Bimachines and Structurally-Reversed Automata.
Journal of Automata, Languages and Combinatorics 9 (2004) 1,
121–146.
-
P. WEIL:
On the
Logical Definability of Certain Graph and Poset Languages.
Journal of Automata, Languages and Combinatorics 9 (2004) 1,
147–165.
|
