formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik
ALL VOLUMES
1996 – 2015
ALL NUMBERS
H. N. ADORNA: 3-Party Message Complexity is Better
than 2-Party Ones for Proving Lower Bounds on the Size of Minimal
Nondeterministic Finite Automata. Journal of Automata,
Languages and Combinatorics7 (2002) 4, 419–432.
M. K. AHMAD,
X. AUGROS: Some
Results on Codes for Generalized Factorizations. Journal of Automata, Languages and Combinatorics6 (2001) 3,
239–251.
T. A. AL-HAWARY: Characterizations of Certain Matroids via Flats. Journal of Automata, Languages and Combinatorics7 (2002) 3,
295–301.
A. ALHAZOV, G. BEL-ENGUIX, Y. ROGOZHIN: Smallest Filters in Complete
Obligatory Hybrid Networks of Evolutionary Processors. Journal of Automata, Languages and Combinatorics19 (2014)
1–4, 5–16.
C. ALLAUZEN, M. MOHRI: Efficient
Algorithms for Testing the Twins Property. Journal of
Automata, Languages and Combinatorics8 (2003) 2, 117–144.
M. ALMEIDA, N. MOREIRA, R. REIS: Testing the Equivalence of Regular
Languages. Journal of Automata, Languages and
Combinatorics15 (2010) 1/2, 7–25.
S. ANANTHARAMAN, P. NARENDRAN, M. RUSINOWITCH: String
Rewriting and Security Analysis: An Extension of a Result of Book and
Otto. Journal of Automata, Languages and
Combinatorics16 (2011) 2–4, 75–90.
P.-Y. ANGRAND, S. LOMBARDY,
J. SAKAROVITCH: On the Number of Broken Derived Terms of a Rational Expression. Journal of Automata, Languages and Combinatorics15
(2010) 1/2, 27–51.
M. ANSELMO, M. MADONIA: A
Language-Theoretic Approach to Covering Problems. Journal of Automata, Languages and Combinatorics10 (2005) 1,
3–24.
M. H. ARMANIOUS: Cubic and Semi-Cubic
SQS-Skeins. Journal of Automata, Languages and
Combinatorics10 (2005) 1, 25–35.
K. ARTHI, K. KRITHIVASAN, E. CSUHAJ-VARJÚ: On Rule-Number Complexity of
Components of Probabilistic Cooperating Distributed Grammar Systems. Journal of Automata, Languages and Combinatorics7
(2002) 4, 433–446.
P. R. J. ASVELD: Generating all Circular Shifts by
Context-Free Grammars in Chomsky Normal Form. Journal
of Automata, Languages and Combinatorics11 (2006) 2,
147–159.
S. V. AVGUSTINOVICH, A. E.
FRID: Words Avoiding Abelian
Inclusions. Journal of Automata, Languages and
Combinatorics7 (2002) 1, 3–9.
S. AVGUSTINOVICH, S. KITAEV, A. PYATKIN, A. VALYUZHENICH: On Square-Free
Permutations. Journal of Automata, Languages and
Combinatorics16 (2011) 1, 3–10.
S. AYDIN, H. JÜRGENSEN, L. E. ROBBINS: Dialogues as Co-Operating Grammars. Journal of Automata, Languages and Combinatorics6 (2001) 4,
395–410.
M. S. BALAN: Complexity Measures for Binding-Blocking Automata. Journal of Automata, Languages and Combinatorics13
(2008) 2, 105–123.
M. S. BALAN,
K. KRITHIVASAN, M. MADHU: Some Variants
in Communication of Parallel Communicating Pushdown Automata. Journal of Automata, Languages and Combinatorics8 (2003)
3, 401–416.
I. BANÍK: Colonies as Systems of Turing Machines Without States. Journal of Automata, Languages and Combinatorics1 (1996) 2,
81–96.
H. BARENDREGT, V. CAPRETTA, D. KOZEN: Reflection in
the Chomsky Hierarchy. Journal of Automata, Languages
and Combinatorics18 (2013) 1, 53–60.
M. BAUDET: Random
Polynomial-Time Attacks and Dolev-Yao Models. Journal
of Automata, Languages and Combinatorics11 (2006) 1, 7–21.
B. BEHZADI, J.-M. STEYAERT: The Transformation Distance
Problem Revisited. Journal of Automata, Languages and
Combinatorics10 (2005) 5/6, 577–587.
S. N. BEREG,
A. V. KELAREV: An Algorithm for Analysis of Images
in Spatial Information Systems. Journal of Automata,
Languages and Combinatorics8 (2003) 4, 557–565.
A. BERNINI, L. FERRARI, R. PINZANI: Enumeration of Some Classes of
Words Avoiding Two Generalized Patterns of Length Three. Journal of Automata, Languages and Combinatorics14 (2009) 2,
129–147.
V. BERTHÉ, L. VUILLON: Palindromes
and Two-Dimensional Sturmian Sequences. Journal of
Automata, Languages and Combinatorics6 (2001) 2, 121–138.
E. BERTSCH: Abstract Comparison of two Error Detection Techniques for Programming
Languages. Journal of Automata, Languages and
Combinatorics4 (1999) 2, 77–86.
M. P. BIANCHI,
M. HOLZER, S. JAKOBI, C. MEREGHETTI, B. PALANO, G. PIGHIZZINI: On Inverse Operations and Their
Descriptional Complexity. Journal of Automata,
Languages and Combinatorics17 (2012) 2–4, 61–81.
F. BIEGLER: Synchronization Functions of Synchronized Context-Free Grammars and
Languages. Journal of Automata, Languages and
Combinatorics12 (2007) 1/2, 7–24.
F. BIEGLER, M. DALEY, I. MCQUILLAN: On the
Shuffle Automaton Size for Words. Journal of Automata,
Languages and Combinatorics15 (2010) 1/2, 53–70.
F. BLANCHET-SADRI, M. CUCURINGU: Counting Primitive Partial
Words. Journal of Automata, Languages and
Combinatorics15 (2010) 3/4, 199–227.
S. L. BLOOM,
Z. ÉSIK: An
Extension Theorem with an Application to Formal Tree Series. Journal of Automata, Languages and Combinatorics8 (2003)
2, 145–185.
B. BORCHARDT, Z. FÜLÖP, Z. GAZDAG, A. MALETTI: Bounds for Tree Automata with
Polynomial Costs. Journal of Automata, Languages and
Combinatorics10 (2005) 2/3, 107–157.
B. BORCHARDT, H. VOGLER: Determinization of Finite State Weighted Tree Automata. Journal of Automata, Languages and Combinatorics8 (2003) 3,
417–463.
B. BORCHERT: Formal Language Characterizations of P, NP, and PSPACE. Journal of Automata, Languages and Combinatorics13 (2008)
3/4, 161–183.
H. BORDIHN, J. DASSOW, M. KUTRIB, B. TRUTHE: Editorial. Journal of Automata, Languages and Combinatorics16 (2011)
2–4, 71–74.
H. BORDIHN, H. FERNAU: Accepting
Grammars and Systems via Context Condition Grammars. Journal of Automata, Languages and Combinatorics1 (1996) 2,
97–112.
H. BORDIHN, H. FERNAU: The Degree
of Parallelism. Journal of Automata, Languages and
Combinatorics12 (2007) 1/2, 25–47.
H. BORDIHN, M. HOLZER: On the
Number of Active Symbols in L and CD Grammar Systems. Journal of Automata, Languages and Combinatorics6 (2001) 4,
411–426.
H. BORDIHN, M. HOLZER, M. KUTRIB: Economy of Description for Basic
Constructions on Rational Transductions. Journal of
Automata, Languages and Combinatorics9 (2004) 2/3, 175–188.
H. BORDIHN, M. HOLZER, M. KUTRIB: Hairpin Finite Automata. Journal of Automata, Languages and Combinatorics16
(2011) 2–4, 91–107.
H. BORDIHN, M. KUTRIB, M. WENDLANDT: Nonterminal Controlled String
Assembling Systems. Journal of Automata, Languages and
Combinatorics19 (2014) 1–4, 33–44.
H. BORDIHN, B. REICHEL: On
Descriptions of Context-Free Languages by CD Grammar Systems. Journal of Automata, Languages and Combinatorics7 (2002)
4, 447–454.
H. BORDIHN, B. SUNCKEL: On Active
Symbols in CD Grammar Systems. Journal of Automata,
Languages and Combinatorics12 (2007) 1/2, 49–67.
H. BORDIHN, B. SUNCKEL: Descriptional Complexity of Restricted CD Grammar Systems. Journal of Automata, Languages and Combinatorics14
(2009) 1, 7–22.
P. BOTTONI, A. LABELLA, P. MUSSIO, G. PĂUN: Pattern Control on Derivations in
Context-Free Rewriting. Journal of Automata, Languages
and Combinatorics3 (1998) 1, 3–28.
P. BOUYER, F. CHEVALIER: On
Conciseness of Extensions of Timed Automata. Journal
of Automata, Languages and Combinatorics10 (2005) 4,
393–405.
P. BOUYER, A. PETIT: A
Kleene/Büchi-like Theorem for Clock Languages. Journal of Automata, Languages and Combinatorics7 (2002) 2,
167–186.
S. BOZAPALIDIS: Convex Algebras, Convex Modules and Formal Power Series on Trees. Journal of Automata, Languages and Combinatorics1
(1996) 3, 165–180.
S. BOZAPALIDIS, A. GRAMMATIKOPOULOU: Recognizable Picture Series. Journal of Automata,
Languages and Combinatorics10 (2005) 2/3, 159–183.
U. BRANDT, H. K.-G. WALTER: On Testing
Output Faults in the McCluskey Fault Model. Journal of
Automata, Languages and Combinatorics17 (2012) 1, 3–16.
D. BRIDGES, A. MAHALANOBIS: Increasing, Nondecreasing, and Virtually Continuous Functions. Journal of Automata, Languages and Combinatorics6
(2001) 2, 139–143.
R. BRIJDER, M. CAVALIERE, A. RISCOS-NÚÑEZ, G. ROZENBERG, D. SBURLAN: Communication Membrane Systems with
Active Symports. Journal of Automata, Languages and
Combinatorics11 (2006) 3, 241–261.
V. BRUYÈRE, C. DE FELICE: On the Existence of Codings Between Trace Monoids. Journal of Automata, Languages and Combinatorics4 (1999)
2, 87–100.
J. BRZOZOWSKI: Quotient Complexity of Regular Languages. Journal
of Automata, Languages and Combinatorics15 (2010) 1/2,
71–89.
J. BRZOZOWSKI, B. LI, D. LIU: Syntactic Complexities of Six Classes
of Star-Free Languages. Journal of Automata, Languages
and Combinatorics17 (2012) 2–4, 83–105.
P. BUCHHOLZ, P. KEMPER: Weak
Bisimulation for ( max /+) Automata and Related Models. Journal of Automata, Languages and Combinatorics8 (2003) 2,
187–218.
M. BÜCHSE, J. MAY, H. VOGLER: Determinization of Weighted Tree
Automata Using Factorizations. Journal of Automata,
Languages and Combinatorics15 (2010) 3/4, 229–254.
C. CÂMPEANU: Randomness in Blum Universal Static Complexity Spaces. Journal of Automata, Languages and Combinatorics17 (2012)
2–4, 107–122.
C. CÂMPEANU, W. H. HO: The Maximum State Complexity for Finite Languages. Journal of Automata, Languages and Combinatorics9 (2004) 2/3,
189–202.
C. CÂMPEANU, K. SALOMAA, S. YU: Tight Lower Bound for the State
Complexity of Shuffle of Regular Languages. Journal of
Automata, Languages and Combinatorics7 (2002) 3, 303–310.
C. CÂMPEANU, N. SANTEAN, S. YU: A Family of NFAs Free of State
Reductions. Journal of Automata, Languages and
Combinatorics12 (2007) 1/2, 69–78.
S. G. CANAVAL,
V. MITRANA, S. A. VILLAVERDE: Transducers Based on Networks of Evolutionary
Processors. Journal of Automata, Languages and
Combinatorics19 (2014) 1–4, 93–105.
D. CANTONE, S. FARO: Fast-Search
Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching
Algorithm. Journal of Automata, Languages and
Combinatorics10 (2005) 5/6, 589–608.
P. CARON, J.-M. CHAMPARNAUD, L. MIGNOT: Multi-Bar and Multi-Tilde Regular
Operators. Journal of Automata, Languages and
Combinatorics16 (2011) 1, 11–26.
O. CARTON, J.-E. PIN, X. SOLER-ESCRIVÀ: Languages
Recognized by Finite Supersoluble Groups. Journal of
Automata, Languages and Combinatorics14 (2009) 2, 149–161.
J. CASSAIGNE: Double Sequences with Complexity mn+1. Journal of
Automata, Languages and Combinatorics4 (1999) 3, 153–170.
M. CAVALIERE, R. FREUND, A. LEITSCH, G. PĂUN: Event-Related Outputs of
Computations in P Systems. Journal of Automata,
Languages and Combinatorics11 (2006) 3, 263–278.
N. J. CAVENAGH: Latin Trade Algorithms and the
Smallest Critical Set in a Latin Square. Journal of
Automata, Languages and Combinatorics8 (2003) 4, 567–578.
J.-M. CHAMPARNAUD, G. HANSEL, T. PARANTHOËN, D. ZIADI: Random Generation Models for
NFAs. Journal of Automata, Languages and
Combinatorics9 (2004) 2/3, 203–216.
J. CHEN: Timed
Extensions of π Calculus. Journal of Automata,
Languages and Combinatorics11 (2006) 1, 23–58.
C. CHOFFRUT, M. GOLDWURM: Timed
Automata with Periodic Clock Constraints. Journal of
Automata, Languages and Combinatorics5 (2000) 4, 371–403.
C. CHOFFRUT, H. PELIBOSSIAN, P. SIMONNET: Decision
Issues on Functions Realized by Finite Automata. Journal of Automata, Languages and Combinatorics4 (1999) 3,
171–181.
M. CHRISTODOULAKIS, C. S. ILIOPOULOS,
K. PARK, J. S. SIM: Approximate Seeds of Strings. Journal of
Automata, Languages and Combinatorics10 (2005) 5/6,
609–626.
G. CIOBANU, G. M. PINNA, D. SBURLAN: Power of
Causal Dependencies in Rule-Based Systems. Journal of
Automata, Languages and Combinatorics19 (2014) 1–4, 45–56.
L. CLEOPHAS, G. ZWAAN, B. W. WATSON: Constructing Factor Oracles. Journal of Automata,
Languages and Combinatorics10 (2005) 5/6, 627–640.
R. COLE, C. S. ILIOPOULOS,
M. MOHAMED, W. F. SMYTH, L. YANG: The
Complexity of the Minimum k-Cover Problem. Journal
of Automata, Languages and Combinatorics10 (2005) 5/6,
641–653.
E. CSUHAJ-VARJÚ: Parallel Communicating Grammar
Systems with Bounded Resources: Results, Techniques, Open Problems. Journal of Automata, Languages and Combinatorics5
(2000) 3, 175–190.
E. CSUHAJ-VARJÚ, G. VASZIL: On the Descriptional Complexity of
Context-Free Non-returning PC Grammar Systems. Journal
of Automata, Languages and Combinatorics15 (2010) 1/2,
91–105.
F. L. TIPLEA, C. ENE: Hierarchies of Petri Net Languages and a Super-Normal
Form. Journal of Automata, Languages and
Combinatorics2 (1997) 3, 187–204.
F. L. TIPLEA, M. KATSURA,
M. ITO: Processes and Vectorial Characterizations of Parallel Communicating
Grammar Systems. Journal of Automata, Languages and
Combinatorics2 (1997) 1, 47–73.
F. L. TIPLEA, E. MÄKINEN: On the Complexity of a Problem
on Monadic String Rewriting Systems. Journal of
Automata, Languages and Combinatorics7 (2002) 4, 599–609.
K. CULIK II, V. VALENTA: Generalized Finite Automata and
Transducers. Journal of Automata, Languages and
Combinatorics2 (1997) 1, 3–17.
J. CURRIE, H. PETERSEN, J. M. ROBSON, J. SHALLIT: Separating
Words with Small Grammars. Journal of Automata,
Languages and Combinatorics4 (1999) 2, 101–110.
J. D. CURRIE,
R. O. SHELTON: Cantor Sets and Dejean's
Conjecture. Journal of Automata, Languages and
Combinatorics1 (1996) 2, 113–127.
J. CZYZOWICZ, W. FRACZAK, A. PELC: Transducers with Set Output. Journal of Automata, Languages and Combinatorics10
(2005) 1, 37–49.
F. D'ALESSANDRO: On the Complexity of Simon
Automata over the Dyck Language. Journal of Automata,
Languages and Combinatorics8 (2003) 3, 465–476.
F. D'ALESSANDRO,
S. VARRICCHIO: On the Growth of Context-Free Languages. Journal of
Automata, Languages and Combinatorics13 (2008) 2, 95–104.
M. DALEY, M. ERAMIAN, I. MCQUILLAN: The Bag
Automaton: A Model of Nondeterministic Storage. Journal of Automata, Languages and Combinatorics13 (2008) 3/4,
185–206.
M. DALEY, O. H. IBARRA, L. KARI, I. MCQUILLAN, K. NAKANO: The ld and dlad Bio-Operations on
Formal Languages. Journal of Automata, Languages and
Combinatorics8 (2003) 3, 477–498.
Z. DANG, O. H. IBARRA, C. LI, G. XIE: On the Decidability of Model-Checking
for P Systems. Journal of Automata, Languages and
Combinatorics11 (2006) 3, 279–298.
J. DASSOW: Editorial. Journal of Automata, Languages and
Combinatorics20 (2015) 1, 3–4.
J. DASSOW, R. HARBICH: Descriptional Complexity of Union and Star on Context-Free
Languages. Journal of Automata, Languages and
Combinatorics17 (2012) 2–4, 123–143.
J. DASSOW, J. KELEMEN, G. PĂUN: Editorial. Journal of Automata, Languages and Combinatorics19 (2014)
1–4, 3–4.
J. DASSOW, M. KUTRIB, N. MOREIRA, R. REIS: Editorial. Journal of Automata,
Languages and Combinatorics17 (2012) 2–4, 59–60.
J. DASSOW, A. MALCHER: Editorial. Journal of Automata, Languages and
Combinatorics14 (2009) 1, 5–6.
J. DASSOW, F. MANEA, B. TRUTHE: On Subregular Selection Languages in
Internal Contextual Grammars. Journal of Automata,
Languages and Combinatorics17 (2012) 2–4, 145–164.
J. DASSOW, G. PIGHIZZINI, B. TRUTHE: Editorial. Journal of Automata, Languages and
Combinatorics15 (2010) 1/2, 5–5.
C. DE FELICE: Hajós Factorizations of Cyclic
Groups – A Simpler Proof of a Characterization. Journal of Automata, Languages and Combinatorics4 (1999) 2,
111–116.
L. DE PROPHETIS, S. VARRICCHIO: Recognizability of Rectangular Pictures by Wang Systems. Journal of Automata, Languages and Combinatorics2 (1997) 4,
269–288.
R. DE SOUZA, N. KOBAYASHI: A
Combinatorial Study of k-Valued Rational Relations. Journal of Automata, Languages and Combinatorics13 (2008) 3/4,
207–231.
K. DENECKE, J. KOPPITZ, S. SHTRAKOV: The Depth of a
Hypersubstitution. Journal of Automata, Languages and
Combinatorics6 (2001) 3, 253–262.
R. DEVILLERS, H. KLAUDEL, E. PELZ: An Algebraic Box Calculus. Journal of Automata, Languages and Combinatorics5
(2000) 2, 81–107.
J. DEVOLDER: Generators with Bounded Deciphering Delay for Rational
ω-Languages. Journal of Automata, Languages and
Combinatorics4 (1999) 3, 183–204.
C. DIMA: Real-Time
Automata. Journal of Automata, Languages and
Combinatorics6 (2001) 1, 3–23.
M. DOMARATZKI: State Complexity of Proportional Removals. Journal
of Automata, Languages and Combinatorics7 (2002) 4,
455–468.
M. DOMARATZKI, D. KISMAN, J. SHALLIT: On the Number of Distinct Languages
Accepted by Finite Automata with n States. Journal
of Automata, Languages and Combinatorics7 (2002) 4,
469–486.
M. DOMARATZKI, A. OKHOTIN, J. SHALLIT: Enumeration of Context-Free
Languages and Related Structures. Journal of Automata,
Languages and Combinatorics12 (2007) 1/2, 79–95.
M. DOMARATZKI, K. SALOMAA: State
Complexity of Shuffle on Trajectories. Journal of
Automata, Languages and Combinatorics9 (2004) 2/3, 217–232.
C. DOMINIC: δ-Neighborhood Chromatic Index of a Graph. Journal of Automata, Languages and Combinatorics18 (2013) 2,
65–70.
P. DÖMÖSI, Z. ÉSIK: Homomorphic Simulation and Letichevsky's Criterion. Journal of Automata, Languages and Combinatorics6 (2001) 4,
427–436.
F. DREWES, S. EWERT, R. KLEMPIEN-HINRICHS,
H.-J. KREOWSKI: Computing Raster Images from Grid
Picture Grammars. Journal of Automata, Languages and
Combinatorics8 (2003) 3, 499–519.
F. DREWES, R. KLEMPIEN-HINRICHS, H.-J. KREOWSKI: Table-Driven and Context-Sensitive Collage Languages. Journal of Automata, Languages and Combinatorics8 (2003) 1,
5–24.
F. DREWES, H. VOGLER: Learning
Deterministically Recognizable Tree Series. Journal of
Automata, Languages and Combinatorics12 (2007) 3, 333–354.
B. DURAK: Two-Way
Finite Automata with a Write-Once Track. Journal of
Automata, Languages and Combinatorics12 (2007) 1/2, 97–115.
J. DUSKE, R. PARCHMANN: Non-Synchronized Pattern Languages are IO-Macro Languages. Journal of Automata, Languages and Combinatorics2 (1997)
3, 143–149.
J.-P. DUVAL, T. LECROQ,
A. LEFEBVRE: Border Array on Bounded Alphabet. Journal of
Automata, Languages and Combinatorics10 (2005) 1, 51–60.
J.-P. DUVAL, L. MOUCHARD: Sequences Obtained from a Series
of Permutations of Borders and Ultimately Periodic Words. Journal of Automata, Languages and Combinatorics4 (1999) 3,
205–211.
S. EGER: On the
Number of Many-to-Many Alignments of Multiple Sequences. Journal of Automata, Languages and Combinatorics20 (2015) 1,
53–65.
K. ELLUL, B. KRAWETZ, J. SHALLIT, M.-W. WANG: Regular
Expressions: New Results and Open Problems. Journal of
Automata, Languages and Combinatorics9 (2004) 2/3, 233–256.
K. ELLUL, B. KRAWETZ, J. SHALLIT, M.-W. WANG: Regular
Expressions: New Results and Open Problems. Journal
of Automata, Languages and Combinatorics10 (2005) 4,
407–437.
J. ENGELFRIET, Z. FÜLÖP, H. VOGLER: Bottom-Up
and Top-Down Tree Series Transformations. Journal of
Automata, Languages and Combinatorics7 (2002) 1, 11–70.
M. G. ERAMIAN: Efficient Simulation of
Nondeterministic Weighted Finite Automata. Journal of
Automata, Languages and Combinatorics9 (2004) 2/3, 257–267.
S. ERBATUR, A. M. MARSHALL,
D. KAPUR, P. NARENDRAN: Unification over Distributive Exponentiation (Sub)Theories. Journal of Automata, Languages and Combinatorics16
(2011) 2–4, 109–140.
D. ERMEL, D. WÄTJEN: Limited
IL Systems. Journal of Automata, Languages and
Combinatorics8 (2003) 1, 25–42.
Z. ÉSIK, T. HAJGATÓ: On the
Structure of Free Iteration Semirings. Journal of
Automata, Languages and Combinatorics19 (2014) 1–4, 57–66.
Z. ÉSIK, W. KUICH: A Kleene
Theorem for Lindenmayerian Algebraic Power Series. Journal of Automata, Languages and Combinatorics5 (2000) 2,
109–122.
Z. ÉSIK, W. KUICH: Formal Tree
Series. Journal of Automata, Languages and
Combinatorics8 (2003) 2, 219–285.
Z. ÉSIK, W. KUICH: A
Semiring-Semimodule Generalization of ω-Regular Languages I. Journal of Automata, Languages and Combinatorics10
(2005) 2/3, 203–242.
Z. ÉSIK, W. KUICH: A
Semiring-Semimodule Generalization of ω-Regular Languages II. Journal of Automata, Languages and Combinatorics10
(2005) 2/3, 243–264.
Z. ÉSIK, W. KUICH: A
Semiring-Semimodule Generalization of Transducers and Abstract
ω-Families of Power Series. Journal of
Automata, Languages and Combinatorics12 (2007) 4, 435–454.
Z. ÉSIK, Z. L. NÉMETH: Higher Dimensional Automata. Journal of
Automata, Languages and Combinatorics9 (2004) 1, 3–29.
C.-M. FAN, H.-J. SHYR: Languages
Related to the Properties of Disjunctivity and Code. Journal of Automata, Languages and Combinatorics8 (2003) 3,
521–538.
A. FATHOLAHZADEH: Learning the Morphological Features of a Large Set of Words. Journal of Automata, Languages and Combinatorics10
(2005) 5/6, 655–669.
S. Z. FAZEKAS,
B. NAGY: Scattered Subword Complexity of non-Primitive Words. Journal of Automata, Languages and Combinatorics13 (2008) 3/4,
233–247.
H. FERNAU: Membership for k-Limited ET0L Languages is Not Decidable. Journal of Automata, Languages and Combinatorics1 (1996)
4, 243–245.
H. FERNAU: Graph-Controlled Grammars as Language Acceptors. Journal of Automata, Languages and Combinatorics2 (1997) 2,
79–91.
H. FERNAU, R. FREUND, M. OSWALD, K. REINHARDT: Refining the Nonterminal
Complexity of Graph-Controlled, Programmed, and Matrix Grammars. Journal of Automata, Languages and Combinatorics12
(2007) 1/2, 117–138.
H. FERNAU, M. HOLZER: Graph-Controlled Cooperating Distributed Grammar Systems with Singleton
Components. Journal of Automata, Languages and
Combinatorics7 (2002) 4, 487–503.
H. FERNAU, F. STEPHAN: Characterizations of Recursively Enumerable Languages by Programmed
Grammars with Unconditional Transfer. Journal of
Automata, Languages and Combinatorics4 (1999) 2, 117–142.
O. FINKEL: On the
Length of the Wadge Hierarchy of ω-Context Free Languages. Journal of Automata, Languages and Combinatorics10
(2005) 4, 439–464.
F. FRANEK, J. HOLUB, W. F. SMYTH, X. XIAO: Computing Quasi Suffix Arrays. Journal of Automata, Languages and Combinatorics8
(2003) 4, 593–606.
F. FRANEK, W. F. SMYTH, Y. TANG: Computing All
Repeats Using Suffix Arrays. Journal of Automata,
Languages and Combinatorics8 (2003) 4, 579–591.
R. FREUND: Array
Grammar Systems. Journal of Automata, Languages and
Combinatorics5 (2000) 1, 13–29.
R. FREUND, M. OSWALD: P Systems
with Conditional Communication Rules Assigned to Membranes. Journal of Automata, Languages and Combinatorics9 (2004) 4,
387–397.
R. FREUND, M. OSWALD: Array
Grammars and Automata on Cayley Grids. Journal of
Automata, Languages and Combinatorics19 (2014) 1–4, 67–80.
A. E. FRID: On the Frequency of Factors in a D0L Word. Journal of Automata, Languages and Combinatorics3 (1998) 1,
29–41.
C. FROUGNY, L. VUILLON: Coding of
Two-Dimensional Constraints of Finite Type by Substitutions. Journal of Automata, Languages and Combinatorics10 (2005)
4, 465–482.
Z. FÜLÖP: Characterizing Important Subclasses of Attributed Tree Transformations by
Macro Tree Transducers. Journal of Automata, Languages
and Combinatorics6 (2001) 2, 145–189.
Z. FÜLÖP, L. MUZAMEL: Circularity, Composition, and Decomposition Results for Pebble Macro Tree
Transducers. Journal of Automata, Languages and
Combinatorics13 (2008) 1, 3–44.
Z. FÜLÖP, H. VOGLER: Weighted
Tree Transducers. Journal of Automata, Languages and
Combinatorics9 (2004) 1, 31–54.
J. GASO: Unreliable Colonies – the Sequential Case. Journal
of Automata, Languages and Combinatorics5 (2000) 1, 31–44.
Z. GAZDAG: Shape
Preserving Bottom-Up Tree Transducers. Journal of
Automata, Languages and Combinatorics10 (2005) 4, 483–534.
Z. GAZDAG: Remarks
on some Simple Variants of Random Context Grammars. Journal of Automata, Languages and Combinatorics19 (2014)
1–4, 81–92.
F. GÉCSEG, B. IMREH: On Monotone
Automata and Monotone Languages. Journal of Automata,
Languages and Combinatorics7 (2002) 1, 71–82.
F. GÉCSEG, B. IMREH: On Definite
and Nilpotent DR Tree Languages. Journal of Automata,
Languages and Combinatorics9 (2004) 1, 55–60.
F. GÉCSEG, B. IMREH, A. PLUHÁR: On the Existence of Finite
Isomorphically Complete Systems of Automata. Journal
of Automata, Languages and Combinatorics3 (1998) 2, 77–84.
F. GÉCSEG, B. IMREH: On
Asynchronous Tree Automata. Journal of Automata,
Languages and Combinatorics11 (2006) 2, 161–168.
V. GEFFERT: State
Hierarchy for One-Way Finite Automata. Journal of
Automata, Languages and Combinatorics12 (2007) 1/2,
139–145.
D. GENOVA, N. JONOSKA: Topological
Properties of Forbidding-Enforcing Systems. Journal of
Automata, Languages and Combinatorics11 (2006) 4, 375–397.
G. GEORGESCU: On
the Regularity of Languages Generated by Parallel Communicating Grammar
Systems. Journal of Automata, Languages and
Combinatorics1 (1996) 3, 181–197.
C. GERMAIN, J. PALLO: Linear
Languages with a Nonassociative Concatenation. Journal
of Automata, Languages and Combinatorics7 (2002) 3,
311–320.
S. GHILEZAN: Generalized Finiteness of Developments in Typed Lambda Calculi. Journal of Automata, Languages and Combinatorics1
(1996) 4, 247–257.
M. GIRAUD, D. LAVENIER: Dealing
with Hardware Space Limits when Removing Epsilon-Transitions in a Genomic
Weighted Finite Automaton. Journal of Automata,
Languages and Combinatorics10 (2005) 2/3, 265–285.
R. D. GIRI: On the Recognizability of Right Complete Codes. Journal of Automata, Languages and Combinatorics20
(2015) 1, 45–51.
C. GLASSER, H. SCHMITZ: The Boolean
Structure of Dot-Depth One. Journal of Automata,
Languages and Combinatorics6 (2001) 4, 437–452.
W. GÖHRING: Minimal Initializing Word: A Contribution to Cerny's
Conjecture. Journal of Automata, Languages and
Combinatorics2 (1997) 4, 209–226.
J. S. GOLAN,
A. MATEESCU, D. VAIDA: Semirings and
Parallel Composition of Processes. Journal of
Automata, Languages and Combinatorics1 (1996) 3, 199–217.
P. J. GRABNER,
H. PRODINGER: On
the Optimality of an Algorithm of Reingold and Supowit. Journal of Automata, Languages and Combinatorics1 (1996) 1,
5–11.
H. GRALL: A
Confinement Criterion for Securely Executing Mobile Code. Journal of Automata, Languages and Combinatorics11 (2006) 1,
59–106.
G. GRAMLICH, R. HERRMANN: Learning
Unary Automata. Journal of Automata, Languages and
Combinatorics12 (2007) 1/2, 147–165.
R. GROULT, M. LÉONARD, L. MOUCHARD: A Linear
Algorithm for the Detection of Evolutive Tandem Repeats. Journal of Automata, Languages and Combinatorics10 (2005) 5/6,
671–685.
C. GROZEA: NP
Predicates Computable in the Weakest Level of the Grzegorczyck
Hierarchy. Journal of Automata, Languages and
Combinatorics9 (2004) 2/3, 269–279.
H. GRUBER, M. HOLZER, M. KUTRIB: On Measuring Non-recursive
Trade-Offs. Journal of Automata, Languages and
Combinatorics15 (2010) 1/2, 107–120.
J. GRUSKA: Descriptional Complexity Issues in Quantum Computing. Journal of Automata, Languages and Combinatorics5 (2000) 3,
191–218.
J. GRUSKA, I. GUESSARIAN: Fixpoint
Semantics of Synchronized Systems and Correctness of Their Basic
Transformations. Journal of Automata, Languages and
Combinatorics2 (1997) 2, 93–133.
G. GUAIANA, A. RESTIVO, S. SALEMI: On the Trace Product and some
Families of Languages Closed under Partial Commutations. Journal of Automata, Languages and Combinatorics9 (2004) 1,
61–79.
Y. GUESNET: On
Maximal Dense Bifix Codes. Journal of Automata,
Languages and Combinatorics6 (2001) 3, 263–273.
M. A. GUTIÉRREZ-NARANJO, M. J. PÉREZ-JIMÉNEZ,
A. RISCOS-NÚÑEZ: Multi-dimensional Descriptional Complexity of P Systems. Journal of Automata, Languages and Combinatorics12 (2007)
1/2, 167–179.
L. HADDAD, D. LAU, I. G. ROSENBERG: Intervals
of Partial Clones Containing Maximal Clones. Journal
of Automata, Languages and Combinatorics11 (2006) 4,
399–421.
L. HADDAD, H. MACHIDA, I. G. ROSENBERG: Maximal
and Minimal Partial Clones. Journal of Automata,
Languages and Combinatorics7 (2002) 1, 83–93.
Y.-S. HAN, G. TRIPPEN,
D. WOOD: Simple-Regular Expressions and Languages. Journal
of Automata, Languages and Combinatorics12 (2007) 1/2,
181–194.
R. HARBICH, B. TRUTHE: A Comparison
of the Descriptional Complexity of Classes of Limited Lindenmayer
Systems. Journal of Automata, Languages and
Combinatorics17 (2012) 1, 17–56.
S. HARBICH: On the
Descriptional Complexity of k-Uniformly-Limited Lindenmayer
Systems. Journal of Automata, Languages and
Combinatorics18 (2013) 1, 3–25.
P. HARTMANN: Implementation of Parallel Replacement Systems for Cellular
Hypergraphs. Journal of Automata, Languages and
Combinatorics1 (1996) 2, 129–146.
K. HASHIGUCHI, S. ICHIHARA, S. JIMBO: Formal
Languages over Free Bionoids. Journal of Automata,
Languages and Combinatorics5 (2000) 3, 219–234.
K. HASHIGUCHI, T. KUNAI, S. JIMBO: Finite Codes over Free
Binoids. Journal of Automata, Languages and
Combinatorics7 (2002) 4, 505–518.
P.-C. HÉAM: Some Topological Properties of
Rational Sets. Journal of Automata, Languages and
Combinatorics6 (2001) 3, 275–290.
P. M. HIGGINS,
S. ALWAN: Languages that Require Full Scanning of Words to Determine
Membership. Journal of Automata, Languages and
Combinatorics18 (2013) 2, 71–95.
J. HOLUB, C. S. ILIOPOULOS,
B. MELICHAR, L. MOUCHARD: Distributed Pattern Matching Using Finite Automata. Journal of Automata, Languages and Combinatorics6 (2001) 2,
191–204.
M. HOLZER, S. JAKOBI: Descriptional Complexity of Chop Operations on Unary and Finite
Languages. Journal of Automata, Languages and
Combinatorics17 (2012) 2–4, 165–183.
M. HOLZER, M. KUTRIB: Self-Assembling Pushdown Automata. Journal of
Automata, Languages and Combinatorics19 (2014) 1–4,
107–118.
M. HOLZER, M. KUTRIB, J. REIMANN: Non-Recursive Trade-Offs for
Deterministic Restarting Automata. Journal of
Automata, Languages and Combinatorics12 (2007) 1/2,
195–213.
M. HOLZER, K. SALOMAA, S. YU: On the State Complexity of k-Entry
Deterministic Finite Automata. Journal of Automata,
Languages and Combinatorics6 (2001) 4, 453–466.
J. HONKALA: On
Formal Power Series Generated by Lindenmayer Systems. Journal of Automata, Languages and Combinatorics5 (2000) 2,
123–144.
J. HONKALA: Ultimately Periodic Languages. Journal of Automata,
Languages and Combinatorics15 (2010) 3/4, 255–261.
S. HORVÁTH, M. KUDLEK: A Complete
Density Range of Continuum-Many Non-Context-Free Languages Fulfilling Strong
Iteration Properties. Journal of Automata, Languages
and Combinatorics15 (2010) 3/4, 263–268.
J. HROMKOVIC: Descriptional Complexity of Finite Automata: Concepts and Open
Problems. Journal of Automata, Languages and
Combinatorics7 (2002) 4, 519–531.
J. HROMKOVIC, G. SCHNITGER: Lower
Bounds on the Size of Sweeping Automata. Journal of
Automata, Languages and Combinatorics14 (2009) 1, 23–31.
U. HUCKENBECK: On
Valve Adjustments that Interrupt all s-t-Paths in a Digraph. Journal of Automata, Languages and Combinatorics2
(1997) 1, 19–45.
M. HUOVA: A Note
on Defect Theorems for 2-Dimensional Words and Trees. Journal of Automata, Languages and Combinatorics14 (2009) 3/4,
203–209.
O. H. IBARRA,
B. RAVIKUMAR, C. E. GEREDE: Quality-Aware Service Delegation in Automated Web Service
Composition: An Automata-Theoretic Approach. Journal
of Automata, Languages and Combinatorics11 (2006) 2,
169–188.
O. H. IBARRA,
N. Q. TRAN: Weak Synchronization and
Synchronizability of Multi-tape Pushdown Automata and Turing
Machines. Journal of Automata, Languages and
Combinatorics19 (2014) 1–4, 119–132.
C. ILIOPOULOS, L. MOUCHARD, K. PERDIKURI, A. TSAKALIDIS: Computing the Repetitions in a Biological Weighted Sequence. Journal of Automata, Languages and Combinatorics10
(2005) 5/6, 687–696.
C. S. ILIOPOULOS, L. MOUCHARD: Quasiperiodicity: From Detection
to Normal Forms. Journal of Automata, Languages and
Combinatorics4 (1999) 3, 213–228.
C. S. ILIOPOULOS, R. J.
SIMPSON: On-Line Validation and
Analysis of Partially Occluded Images. Journal of
Automata, Languages and Combinatorics6 (2001) 3, 291–303.
B. IMREH, C. IMREH, M. ITO: On Monotonic Directable
Nondeterministic Automata. Journal of Automata,
Languages and Combinatorics8 (2003) 3, 539–547.
T.-O. ISHDORJ: Power and Efficiency of Minimal
Parallelism in Polarizationless P Systems. Journal of
Automata, Languages and Combinatorics11 (2006) 3, 299–320.
S. IVANOV, Y. ROGOZHIN, S. VERLAN: Small
Universal Networks of Evolutionary Processors. Journal
of Automata, Languages and Combinatorics19 (2014) 1–4,
133–144.
P. JANCAR, F. MRÁZ, M. PLÁTEK, J. VOGEL: On Monotonic
Automata with a Restart Operation. Journal of
Automata, Languages and Combinatorics4 (1999) 4, 287–311.
P. JANCAR, F. MRÁZ, M. PLÁTEK, J. VOGEL: Monotonicity of Restarting
Automata. Journal of Automata, Languages and
Combinatorics12 (2007) 3, 355–371.
J. JEDRZEJOWICZ: Undecidability Results for Shuffle Languages. Journal of Automata, Languages and Combinatorics1 (1996) 2,
147–159.
J.-B. JEANNIN, D. KOZEN: Computing with Capsules. Journal of Automata, Languages and Combinatorics17
(2012) 2–4, 185–204.
A. JEŻ, T. JURDZIŃSKI: Length-reducing Automata (almost) without Auxiliary Symbols. Journal of Automata, Languages and Combinatorics16
(2011) 2–4, 141–164.
M. J. P. JIMÉNEZ, A. R.
JIMÉNEZ, F. S. CAPARRINI: A
Polynomial Complexity Class in P Systems Using Membrane Division. Journal of Automata, Languages and Combinatorics11
(2006) 4, 423–434.
G. JIRÁSKOVÁ, A. OKHOTIN: Nondeterministic State Complexity of Positional Addition. Journal of Automata, Languages and Combinatorics15 (2010)
1/2, 121–133.
H. JÜRGENSEN: Markers and Deterministic Acceptors for Non-Deterministic
Languages. Journal of Automata, Languages and
Combinatorics14 (2009) 1, 33–62.
H. JÜRGENSEN, M. KATSURA, S. KONSTANTINIDIS: Maximal Solid Codes. Journal of Automata, Languages and Combinatorics6
(2001) 1, 25–50.
H. JÜRGENSEN, S. KONSTANTINIDIS, N. H. LÂM: Asymptotically Optimal Low-Cost Solid Codes. Journal of Automata, Languages and Combinatorics9 (2004) 1,
81–102.
M. KAMBITES, F. OTTO: Church-Rosser
Groups and Growing Context-Sensitive Groups. Journal
of Automata, Languages and Combinatorics13 (2008) 3/4,
249–267.
K. KÁNTOR, G. VASZIL: Generalized
P Colony Automata. Journal of Automata, Languages and
Combinatorics19 (2014) 1–4, 145–156.
C. A. KAPOUTSIS: Deterministic Moles Cannot Solve
Liveness. Journal of Automata, Languages and
Combinatorics12 (2007) 1/2, 215–235.
C. A. KAPOUTSIS: Minicomplexity. Journal of Automata, Languages and Combinatorics17 (2012)
2–4, 205–224.
M. KAPPES: Multi-Bracketed Contextual Grammars. Journal of
Automata, Languages and Combinatorics3 (1998) 2, 85–103.
M. KAPPES: Descriptional Complexity of Deterministic Finite Automata with Multiple
Initial States. Journal of Automata, Languages and
Combinatorics5 (2000) 3, 269–278.
M. KAPPES, C. M. R. KINTALA: Tradeoffs Between Reliability and
Conciseness of Deterministic Finite Automata. Journal
of Automata, Languages and Combinatorics9 (2004) 2/3,
281–292.
L. KARI, S. KONSTANTINIDIS: Descriptional Complexity of Error/Edit Systems. Journal of Automata, Languages and Combinatorics9 (2004) 2/3,
293–309.
L. KARI, M. KULKARNI: Generating
the Pseudo-Powers of a Word. Journal of Automata,
Languages and Combinatorics19 (2014) 1–4, 157–171.
L. KARI, G. THIERRIN: Omega-Syntactic Congruences. Journal of Automata,
Languages and Combinatorics1 (1996) 1, 13–26.
A. KARTZOW: The
Field of the Reals and the Random Graph are not Finite-Word
Ordinal-Automatic. Journal of Automata, Languages and
Combinatorics20 (2015) 1, 27–43.
A. KELAREV, O. SOKRATOVA: Directed
Graphs and Syntactic Algebras of Tree Languages. Journal of Automata, Languages and Combinatorics6 (2001) 3,
305–311.
J. KELEMEN, A. KELEMENOVÁ: Grammar Systems: Where are we? And Where do we go from Here? (As an
Editorial). Journal of Automata, Languages and
Combinatorics5 (2000) 1, 5–12.
R. KEMP: On
Prefixes of Formal Languages and Their Relation to the Average-Case
Complexity of the Membership Problem. Journal of
Automata, Languages and Combinatorics1 (1996) 4, 259–303.
R. KEMP: On
Leftist Simply Generated Trees. Journal of Automata,
Languages and Combinatorics4 (1999) 4, 313–331.
R. KEMP: On the
Expected Number of Leftist Nodes in Simply Generated Trees. Journal of Automata, Languages and Combinatorics6 (2001) 3,
313–343.
B. KHOUSSAINOV, S. RUBIN: Graphs with
Automatic Presentations over a Unary Alphabet. Journal
of Automata, Languages and Combinatorics6 (2001) 4,
467–480.
B. KHOUSSAINOV, S. RUBIN: Automatic
Structures: Overview and Future Directions. Journal of
Automata, Languages and Combinatorics8 (2003) 2, 287–301.
C. M. KINTALA: Software Rejuvenation in Embedded
Systems. Journal of Automata, Languages and
Combinatorics14 (2009) 1, 63–73.
D. KIRSTEN, I. MÄURER: On the
Determinization of Weighted Automata. Journal of
Automata, Languages and Combinatorics10 (2005) 2/3,
287–312.
S. KITAEV: There
are no Iterated Morphisms that Define the Arshon Sequence and the
σ-Sequence. Journal of Automata, Languages and
Combinatorics8 (2003) 1, 43–50.
S. KITAEV: On
Graphs with Representation Number 3. Journal of
Automata, Languages and Combinatorics18 (2013) 2, 97–112.
S. KITAEV, T. MANSOUR, P. SÉÉBOLD: Generating the Peano Curve and
Counting Occurrences of some Patterns. Journal of
Automata, Languages and Combinatorics9 (2004) 4, 439–455.
S. KITAEV, A. PYATKIN: On
Representable Graphs. Journal of Automata, Languages
and Combinatorics13 (2008) 1, 45–54.
J. KLEIJN, M. KOUTNY, G. ROZENBERG: Process Semantics for Membrane
Systems. Journal of Automata, Languages and
Combinatorics11 (2006) 3, 321–340.
A. KLEIN, M. KUTRIB: Self-Assembling Finite Automata. Journal of
Automata, Languages and Combinatorics14 (2009) 1, 75–92.
S. KONSTANTINIDIS, P. V. SILVA: Maximal Error-Detecting Capabilities of Formal Languages. Journal of Automata, Languages and Combinatorics13
(2008) 1, 55–71.
S. KONSTANTINIDIS, J. YOUNG: f-Words and
Binary Solid Codes. Journal of Automata, Languages and
Combinatorics15 (2010) 3/4, 269–283.
J. KORTELAINEN: On
the System of Word Equations x0u1ix1u2ix2… umixm =
y0v1iy1v2iy2… vniyn(i = 0,1,2,…) in a Free
Monoid. Journal of Automata, Languages and
Combinatorics3 (1998) 1, 43–57.
M. KRÉSZ: Graph
Decomposition and Descriptional Complexity of Soliton Automata. Journal of Automata, Languages and Combinatorics12
(2007) 1/2, 237–263.
M. KRIESELL: A
Note on Hamiltonian Cycles in Lexicographical Products. Journal of Automata, Languages and Combinatorics2 (1997) 2,
135–138.
S. N. KRISHNA,
R. RAMA: P
Systems with Replicated Rewriting. Journal of
Automata, Languages and Combinatorics6 (2001) 3, 345–350.
A. KROKHIN, I. G. ROSENBERG: A Monoidal Interval of Clones of Selfdual Functions. Journal of Automata, Languages and Combinatorics11
(2006) 2, 189–208.
D. KUSKE, R. MORIN: Pomsets for
Local Trace Languages. Journal of Automata, Languages
and Combinatorics7 (2002) 2, 187–224.
M. KUTRIB: Refining Nondeterminism Below Linear Time. Journal
of Automata, Languages and Combinatorics7 (2002) 4,
533–547.
M. KUTRIB, A. MALCHER: One-Way
Cellular Automata, Bounded Languages, and Minimal Communication. Journal of Automata, Languages and Combinatorics15
(2010) 1/2, 135–153.
G. LAGOGIANNIS, C. MAKRIS, Y. PANAGIS, S. SIOUTAS,
K. TSICHLAS: New
Dynamic Balanced Search Trees with Worst-Case Constant Update Time. Journal of Automata, Languages and Combinatorics8
(2003) 4, 607–632.
G. LAGOGIANNIS, C. MAKRIS, Y. PANAGIS, S. SIOUTAS,
K. TSICHLAS: Rectangle Enclosure Reporting in Linear Space Revisited. Journal of Automata, Languages and Combinatorics8 (2003) 4,
633–645.
R. LANOTTE: Expressive Power of Hybrid Systems with Real Variables, Integer Variables
and Arrays. Journal of Automata, Languages and
Combinatorics12 (2007) 3, 373–405.
M. LATTEUX: Valence Languages Generated by Equality Sets. Journal of Automata, Languages and Combinatorics9 (2004) 4,
399–406.
A. LEFEBVRE, T. LECROQ, J. ALEXANDRE: An Improved Algorithm for Finding
Longest Repeats with a Modified Factor Oracle. Journal
of Automata, Languages and Combinatorics8 (2003) 4,
647–657.
A. LEPORATI, G. MAURI, A. E. PORRECA, C. ZANDRON: A Gap in the Space Hierarchy of P
Systems with Active Membranes. Journal of Automata,
Languages and Combinatorics19 (2014) 1–4, 173–184.
H. LEUNG: On a
Family of Nondeterministic Finite Automata. Journal of
Automata, Languages and Combinatorics5 (2000) 3, 235–244.
H. LEUNG: A
Technique for Proving Lower Bounds on the Size of Sweeping Automata. Journal of Automata, Languages and Combinatorics14
(2009) 1, 93–105.
Z.-Z. LI, H.-J. SHYR, Y.-S. TSAI: Automata Accepting Bifix Codes. Journal of
Automata, Languages and Combinatorics13 (2008) 3/4,
269–297.
J. LIEBEHENSCHEL: Ranking and Unranking of Lexicographically Ordered Words: an Average-Case
Analysis. Journal of Automata, Languages and
Combinatorics2 (1997) 4, 227–268.
J. LIEBEHENSCHEL: On the Connection Between Lexicographical Generation and Ranking. Journal of Automata, Languages and Combinatorics8
(2003) 1, 51–57.
N. LIMAYE, M. MAHAJAN, A. MEYER: On the Complexity of Membership and
Counting in Height-Deterministic Pushdown Automata. Journal of Automata, Languages and Combinatorics14 (2009) 3/4,
211–235.
S. LIMET, G. SALZER: Basic
Rewriting via Logic Programming, with an Application to the Reachability
Problem. Journal of Automata, Languages and
Combinatorics11 (2006) 1, 107–142.
C. C. LINDNER: A Small Embedding for Partial
4-Cycle Systems when the Leave is Small. Journal of
Automata, Languages and Combinatorics8 (2003) 4, 659–662.
R. LOOS, F. MANEA, V. MITRANA: Small Universal Accepting Networks
of Evolutionary Processors with Filtered Connections. Journal of Automata, Languages and Combinatorics15 (2010) 1/2,
155–174.
V. V. LOZIN: Graph Representation Functions Computable by Finite
Automata. Journal of Automata, Languages and
Combinatorics13 (2008) 1, 73–90.
J.-G. LUQUE, L. MIGNOT,
F. NICART: Some
Combinatorial Operators in Language Theory. Journal of
Automata, Languages and Combinatorics18 (2013) 1, 27–52.
M. MADHU: Descriptional Complexity of Rewriting P Systems. Journal of Automata, Languages and Combinatorics9 (2004) 2/3,
311–316.
M. MADHU, K. KRITHIVASAN: Length
Synchronization Context-Free Grammars. Journal of
Automata, Languages and Combinatorics9 (2004) 4, 457–464.
M. MADONIA, S. SALEMI, T. SPORTELLI: Covering Submonoids and Covering
Codes. Journal of Automata, Languages and
Combinatorics4 (1999) 4, 333–350.
A. MAES: An
Automata Theoretic Decidability Proof for First-Order Theory of langle
nat ,<,P rangle with Morphic Predicate P. Journal
of Automata, Languages and Combinatorics4 (1999) 3,
229–245.
E. MÄKINEN: On
the Inclusion Problem for Very Simple Deterministic Pushdown
Automata. Journal of Automata, Languages and
Combinatorics6 (2001) 3, 351–357.
A. MALCHER: Descriptional Complexity of Cellular Automata and Decidability
Questions. Journal of Automata, Languages and
Combinatorics7 (2002) 4, 549–560.
A. MALCHER: On
Recursive and Non-recursive Trade-Offs between Finite-Turn Pushdown
Automata. Journal of Automata, Languages and
Combinatorics12 (2007) 1/2, 265–277.
A. MALCHER, K. MECKEL, C. MEREGEHETTI, B. PALANO: Descriptional Complexity of Pushdown
Store Languages. Journal of Automata, Languages and
Combinatorics17 (2012) 2–4, 225–244.
A. MALETTI, H. VOGLER: Incomparability Results for Classes of Polynomial Tree Series
Transformations. Journal of Automata, Languages and
Combinatorics10 (2005) 4, 535–568.
V. MANCA, C. MARTÍN-VIDE, G. PĂUN: On the Power of P Systems with
Replicated Rewriting. Journal of Automata, Languages
and Combinatorics6 (2001) 3, 359–374.
S. MANETH, H. VOGLER: Attributed
Context-Free Hypergraph Grammars. Journal of Automata,
Languages and Combinatorics3 (1998) 2, 105–147.
T. MANSOUR, A. O. MUNAGI: Enumeration of Gap-Bounded Set Partitions. Journal of Automata, Languages and Combinatorics14 (2009) 3/4,
237–245.
P. MANYEM, R. L. SALT, M. S. VISSER: Approximation Lower Bounds in Online LIB Bin Packing and
Covering. Journal of Automata, Languages and
Combinatorics8 (2003) 4, 663–674.
M. MARGENSTERN: Pentagrid and Heptagrid: the Fibonacci Technique and Group Theory. Journal of Automata, Languages and Combinatorics19
(2014) 1–4, 201–212.
C. MARTÍN-VIDE, A. MATEESCU: Special Families of Sewing
Languages. Journal of Automata, Languages and
Combinatorics5 (2000) 3, 279–286.
C. MARTÍN-VIDE, V. MITRANA: Grammars with Bounded-Life
Resources. Journal of Automata, Languages and
Combinatorics7 (2002) 4, 561–570.
C. MARTÍN-VIDE, V. MITRANA, R. STIEBE: Weighted Grammars and Automata with
Threshold Interpretation. Journal of Automata,
Languages and Combinatorics8 (2003) 2, 303–318.
C. MARTIN-VIDE, G. PĂUN: Cooperating Distributed Splicing
Systems. Journal of Automata, Languages and
Combinatorics4 (1999) 1, 3–16.
A. MATEESCU, K. SALOMAA, S. YU: On Fairness of Many-Dimensional
Trajectories. Journal of Automata, Languages and
Combinatorics5 (2000) 2, 145–157.
I. MCQUILLAN: Descriptional Complexity of
Block-Synchronization Context-Free Grammars. Journal
of Automata, Languages and Combinatorics9 (2004) 2/3,
317–332.
A. MEDUNA: Descriptional Complexity of Scattered Rewriting and Multirewriting: An
Overview. Journal of Automata, Languages and
Combinatorics7 (2002) 4, 571–577.
I. MEINECKE: The
Hadamard Product of Sequential-Parallel Series. Journal of Automata, Languages and Combinatorics10 (2005) 2/3,
313–346.
C. MEREGHETTI, B. PALANO: The Parallel
Complexity of Deterministic and Probabilistic Automata. Journal of Automata, Languages and Combinatorics7 (2002) 1,
95–108.
C. MEREGHETTI, G. PIGHIZZINI: Two-Way
Automata Simulations and Unary Languages. Journal of
Automata, Languages and Combinatorics5 (2000) 3, 287–300.
H. MESSERSCHMIDT, M. STOMMEL: Church-Rosser Picture Languages and Their Applications in Picture
Recognition. Journal of Automata, Languages and
Combinatorics16 (2011) 2–4, 165–194.
V. P. METTA,
A. KELEMENOVÁ: Smaller Universal Spiking Neural P Systems with Anti-Spikes. Journal of Automata, Languages and Combinatorics19
(2014) 1–4, 213–226.
A. R. MEYER,
A. RABINOVICH: Valid Identity Problem for Shuffle Regular Expressions. Journal of Automata, Languages and Combinatorics7 (2002) 1,
109–125.
T. MIHÁLYDEÁK, Z. E. CSAJBÓK: On the Membrane Computations in the Presence of Membrane
Boundaries. Journal of Automata, Languages and
Combinatorics19 (2014) 1–4, 227–238.
M. MILANI, G. PIGHIZZINI: Tight
Bounds on the Simulation of Unary Probabilistic Automata by Deterministic
Automata. Journal of Automata, Languages and
Combinatorics6 (2001) 4, 481–492.
C. MILLER: Context
Derivation Sets and Context-Free Normal Forms. Journal
of Automata, Languages and Combinatorics9 (2004) 2/3,
333–345.
V. MITRANA: Iterated Pattern Languages. Journal of Automata,
Languages and Combinatorics1 (1996) 4, 305–311.
V. MITRANA: Crossover Systems. A Generalization of Splicing Systems. Journal of Automata, Languages and Combinatorics2 (1997) 3,
151–160.
V. MITRANA: On the
Degree of Communication in Parallel Communicating Finite Automata
Systems. Journal of Automata, Languages and
Combinatorics5 (2000) 3, 301–314.
M. MOHRI: Semiring
Frameworks and Algorithms for Shortest-Distance Problems. Journal of Automata, Languages and Combinatorics7 (2002) 3,
321–350.
J. A. MONTOYA: Open Problems Related to Palindrome
Recognition: Are There Open Problems Related to Palindrome
Recognition?. Journal of Automata, Languages and
Combinatorics20 (2015) 1, 5–25.
F. MRÁZ: Lookahead Hierarchies of Restarting Automata. Journal of Automata, Languages and Combinatorics6 (2001) 4,
493–506.
B. NAGY: Languages
Generated by Context-Free Grammars Extended by Type AB to BA
Rules. Journal of Automata, Languages and
Combinatorics14 (2009) 2, 175–186.
B. NAGY: On
CD-Systems of Stateless Deterministic R(2)-Automata. Journal of Automata, Languages and Combinatorics16 (2011)
2–4, 195–213.
T. NAKATOH, K. BABA, D. IKEDA, Y. YAMADA,
S. HIROKAWA: An
Efficient Mapping for Computing the Score of String Matching. Journal of Automata, Languages and Combinatorics10
(2005) 5/6, 697–704.
M. E. NEBEL: New Results on the Stack Ramification of Binary Trees. Journal of Automata, Languages and Combinatorics2
(1997) 3, 161–175.
M. E. NEBEL: On the Power of Subroutines for Finite State Machines. Journal of Automata, Languages and Combinatorics6
(2001) 1, 51–74.
J. NÉRAUD, C. SELMI: A
Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of
A*. Journal of Automata, Languages and
Combinatorics9 (2004) 1, 103–110.
I. M. NICULESCU,
M. GHEORGHE, F. IPATE, A. STEFANESCU: From Kernel P Systems to
X-Machines and FLAME. Journal of Automata, Languages
and Combinatorics19 (2014) 1–4, 239–250.
F. NIESSNER: Büchi Automata and Their Degrees of Nondeterminism and
Ambiguity. Journal of Automata, Languages and
Combinatorics9 (2004) 2/3, 347–363.
T. Y. NISHIDA: Sizes of Context-Free Languages
Generated by Context-Free Grammars and Stable and Recurrent 0L
Systems. Journal of Automata, Languages and
Combinatorics6 (2001) 4, 507–518.
T. Y. NISHIDA: Some New Aspects of Word-Length
Controlled DT0L Systems. Journal of Automata,
Languages and Combinatorics10 (2005) 1, 61–77.
T. Y. NISHIDA: An Efficient Derivation Method for
DT0L Systems and a Measure of Derivation Complexity. Journal of Automata, Languages and Combinatorics14 (2009) 2,
187–198.
A. OKHOTIN: Conjunctive Grammars. Journal of Automata,
Languages and Combinatorics6 (2001) 4, 519–535.
A. OKHOTIN: State
Complexity of Linear Conjunctive Grammars. Journal of
Automata, Languages and Combinatorics9 (2004) 2/3, 365–381.
A. OKHOTIN: Homomorphisms Preserving Linear Conjunctive Languages. Journal of Automata, Languages and Combinatorics13 (2008) 3/4,
299–305.
F. OTTO: On Dehn
Functions of Finitely Presented Bi-Automatic Monoids. Journal of Automata, Languages and Combinatorics5 (2000) 4,
405–419.
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 Combinatorics9 (2004) 4, 407–437.
F. OTTO, N. RUSKUC: Confluent Monadic String-Rewriting Systems and Automatic
Structures. Journal of Automata, Languages and
Combinatorics6 (2001) 3, 375–388.
A. PALIOUDAKIS, K. SALOMAA, S. G. AKL: State
Complexity of Finite Tree Width NFAs. Journal of
Automata, Languages and Combinatorics17 (2012) 2–4,
245–264.
A. PALIOUDAKIS, K. SALOMAA, S. G. AKL: Lower Bound for
Converting an NFA with Finite Nondeterminism into an MDFA. Journal of Automata, Languages and Combinatorics19 (2014)
1–4, 251–264.
A. PANHOLZER: Gröbner Bases and the Defining Polynomial of a Context-Free Grammar
Generating Function. Journal of Automata, Languages
and Combinatorics10 (2005) 1, 79–97.
D. PARDUBSKÁ, F. MRÁZ, M. PLÁTEK: Translations by Regulated Parallel Communicating Grammar Systems. Journal of Automata, Languages and Combinatorics16
(2011) 2–4, 215–251.
D. PELED, M. Y. VARDI, M. YANNAKAKIS: Black
Box Checking. Journal of Automata, Languages and
Combinatorics7 (2002) 2, 225–246.
E. PELUSO, J. GOLDSTINE, S. PHOHA: Normal
Processes for Modeling the Desired Behavior of Distributed Autonomous
Discrete Event Systems. Journal of Automata, Languages
and Combinatorics7 (2002) 1, 127–142.
H. PETERSEN: Prefix Rewriting and Descriptional Complexity. Journal of Automata, Languages and Combinatorics5 (2000) 3,
245–254.
T. PETKOVIC, M. STEINBY: Piecewise
Directable Automata. Journal of Automata, Languages
and Combinatorics6 (2001) 2, 205–220.
E. PETRE: Watson-Crick ω-Automata. Journal of
Automata, Languages and Combinatorics8 (2003) 1, 59–70.
I. PETRE: Parikh's
Theorem Does Not Hold for Multiplicities. Journal of
Automata, Languages and Combinatorics4 (1999) 1, 17–30.
I. PETRE, V. ROGOJIN: Dependency
Relations Between Elementary Intramolecular Operations in Gene Assembly in
Ciliates. Journal of Automata, Languages and
Combinatorics19 (2014) 1–4, 265–277.
G. PIGHIZZINI: Nondeterministic One-Tape Off-Line Turing Machines. Journal of Automata, Languages and Combinatorics14 (2009) 1,
107–124.
A. PLATZER: Logical Analysis of Hybrid Systems: A Answer to a Complexity
Challenge. Journal of Automata, Languages and
Combinatorics17 (2012) 2–4, 265–275.
L. POLÁK: Remarks on Multiple Entry Deterministic Finite Automata. Journal of Automata, Languages and Combinatorics12 (2007)
1/2, 279–288.
A. PĂUN: On
the Diameter of Various Classes of H Systems. Journal
of Automata, Languages and Combinatorics5 (2000) 3,
315–324.
G. PĂUN: Regular Extended H Systems are Computationally Universal. Journal of Automata, Languages and Combinatorics1 (1996)
1, 27–36.
G. PĂUN: P
Systems with Active Membranes: Attacking NP-Complete Problems. Journal of Automata, Languages and Combinatorics6 (2001)
1, 75–90.
G. PĂUN, G. ROZENBERG, A. SALOMAA: Pattern
Grammars. Journal of Automata, Languages and
Combinatorics1 (1996) 3, 219–235.
V. RADHAKRISHNAN, V. T, CHAKARAVARTHY,
K. KRITHIVASAN: Pattern Matching in Matrix Grammars. Journal of
Automata, Languages and Combinatorics3 (1998) 1, 59–72.
G. RAHONIS: Weighted Muller Tree Automata and Weighted Logics. Journal of Automata, Languages and Combinatorics12 (2007) 4,
455–483.
M. V. P. RAO, V. VINAY: Quantum Finite Automata and Weighted Automata. Journal of Automata, Languages and Combinatorics13 (2008) 2,
125–139.
J.-F. RASKIN, P.-Y. SCHOBBENS: The Logic
of Event Clocks – Decidability, Complexity and Expressiveness. Journal of Automata, Languages and Combinatorics4 (1999)
3, 247–282.
O. RAVSKY: A New
Measure of Asymmetry of Binary Words. Journal of
Automata, Languages and Combinatorics8 (2003) 1, 71–74.
O. RAVSKY: On the
Palindromic Decomposition of Binary Words. Journal of
Automata, Languages and Combinatorics8 (2003) 1, 75–83.
D. REIDENBACH: An
Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem
for E-Pattern Languages. Journal of Automata,
Languages and Combinatorics12 (2007) 3, 407–426.
M. RIGO, A. MAES: More on
Generalized Automatic Sequences. Journal of Automata,
Languages and Combinatorics7 (2002) 3, 351–376.
A. ROMAN: A Note
on Cerny Conjecture for Automata over 3-Letter Alphabet. Journal of Automata, Languages and Combinatorics13
(2008) 2, 141–143.
I. ROSENBERG, D. SCHWEIGERT: Locally
Maximal Clones II. Journal of Automata, Languages and
Combinatorics5 (2000) 4, 421–455.
K. RUOHNEN: Equivalence of Set- and Bag-Valued Orbits. Journal
of Automata, Languages and Combinatorics14 (2009) 3/4,
247–253.
J. J. M. M. RUTTEN: Coinductive
Counting with Weighted Automata. Journal of Automata,
Languages and Combinatorics8 (2003) 2, 319–352.
A. SAARELA: Ultimately Constant Abelian Complexity of Infinite Words. Journal of Automata, Languages and Combinatorics14 (2009)
3/4, 255–258.
Y. SAKAKIBARA, H. IMAI: A DNA-Based
Computational Model Using a Specific Type of Restriction Enzymes. Journal of Automata, Languages and Combinatorics9
(2004) 1, 111–119.
A. N. M. SALMAN, H. BROERSMA,
E. T. BASKORO: Spanning 2-Connected Subgraphs in
Alphabet Graphs, Special Classes of Grid Graphs. Journal of Automata, Languages and Combinatorics8 (2003) 4,
675–681.
A. SALOMAA: Compositions of Reaction Systems. Journal of
Automata, Languages and Combinatorics19 (2014) 1–4,
279–290.
K. SALOMAA: On the
Modularity of Decidability of Completeness and Termination. Journal of Automata, Languages and Combinatorics1 (1996) 1,
37–53.
K. SALOMAA, S. YU: NFA to DFA
Transformation for Finite Languages over Arbitrary Alphabets. Journal of Automata, Languages and Combinatorics2 (1997)
3, 177–186.
N. SANTEAN: Bimachines and Structurally-Reversed Automata. Journal of Automata, Languages and Combinatorics9 (2004) 1,
121–146.
H. SCHMITZ: Restricted Temporal Logic and Deterministic Languages. Journal of Automata, Languages and Combinatorics5 (2000) 3,
325–341.
E. D. SCHWAB: On Fibonacci and Thue-Morse
Words. Journal of Automata, Languages and
Combinatorics15 (2010) 3/4, 285–295.
S. SCHWARZ: Lukasiewicz Logic and Weighted Logics over MV-Semirings. Journal of Automata, Languages and Combinatorics12
(2007) 4, 485–499.
P. SÉÉBOLD: About some Overlap-Free Morphisms on a n-Letter Alphabet. Journal of Automata, Languages and Combinatorics7 (2002)
4, 579–597.
J. M. SEMPERE: On a Class of Regular-like
Expressions for Linear Languages. Journal of Automata,
Languages and Combinatorics5 (2000) 3, 343–354.
J. SHALLIT: Automaticity and Rationality. Journal of Automata,
Languages and Combinatorics5 (2000) 3, 255–268.
J. SHALLIT, M.-W. WANG: Automatic Complexity of
Strings. Journal of Automata, Languages and
Combinatorics6 (2001) 4, 537–554.
H.-J. SHYR: Regular Nests. Journal of Automata, Languages and Combinatorics7 (2002) 1,
143–157.
H.-J. SHYR, S.-S. YU: Some Properties
of Left Non-Cancellative Languages. Journal of
Automata, Languages and Combinatorics4 (1999) 4, 351–360.
P. V. SILVA: Groups and Automata: a Perfect Match. Journal of Automata, Languages and Combinatorics17 (2012)
2–4, 277–292.
M. SOLTYS: Feasible Proofs of Szpilrajn's Theorem – A Proof-Complexity Framework for
Concurrent Automata. Journal of Automata, Languages
and Combinatorics16 (2011) 1, 27–38.
P. SOSÍK: On
the Decidability Problems of Eco-Grammar Systems. Journal of Automata, Languages and Combinatorics5 (2000) 1,
45–58.
P. SOSÍK: PSPACE Limits the Power of P Systems with Active Membranes. Journal of Automata, Languages and Combinatorics19
(2014) 1–4, 291–304.
L. STAIGER: Weighted Finite Automata and Metrics in Cantor Space. Journal of Automata, Languages and Combinatorics8 (2003) 2,
353–360.
E. W. STARK: On Behaviour Equivalence for Probabilistic I/O Automata and
its Relationship to Probabilistic Bisimulation. Journal of Automata, Languages and Combinatorics8 (2003) 2,
361–395.
R. STIEBE, S. TURAEV: Capacity-Bounded Grammars. Journal of Automata,
Languages and Combinatorics15 (2010) 1/2, 175–194.
A. STULMAN: Generating Optimal Distinguishing Sequences for Testing Timed
Protocols. Journal of Automata, Languages and
Combinatorics16 (2011) 1, 39–54.
K. G. SUBRAMANIAN, D. G.
THOMAS, P. H.
CHANDRA, M. HOEBERECHTS: Basic Puzzle Grammars and
Generation of Polygons. Journal of Automata, Languages
and Combinatorics6 (2001) 4, 555–568.
L. SUBRAMANIAN, M. TALUPUR, K. KRITHIVASAN, C. P.
RANGAN: On the Generative Power of
Simple H Systems. Journal of Automata, Languages and
Combinatorics5 (2000) 4, 457–473.
B. SUNCKEL: On the
Descriptional Complexity of External Hybrid Cooperating Distributed Grammar
Systems. Journal of Automata, Languages and
Combinatorics11 (2006) 4, 435–447.
B. SUNCKEL: On the
Descriptional Complexity of CD Grammar Systems of Finite Index. Journal of Automata, Languages and Combinatorics12
(2007) 1/2, 289–306.
K. SUTNER, K. LEWI: Iterating
Inverse Binary Transducers. Journal of Automata,
Languages and Combinatorics17 (2012) 2–4, 293–313.
G. R. SYMEON BOZAPALIDIS: On
the Closure of Recognizable Tree Series Under Tree Homomorphisms. Journal of Automata, Languages and Combinatorics10
(2005) 2/3, 185–202.
M. H. TER BEEK,
J. KLEIJN: On
Distributed Cooperation and Synchronised Collaboration. Journal of Automata, Languages and Combinatorics19 (2014)
1–4, 17–32.
M. H. TER BEEK,
G. LENZINI, M. PETROCCHI: A Team
Automaton Scenario for the Analysis of Security Properties of Communication
Protocols. Journal of Automata, Languages and
Combinatorics11 (2006) 4, 345–374.
P. TESSON, D. THÉRIEN: The
Computing Power of Programs over Finite Monoids. Journal of Automata, Languages and Combinatorics7 (2002) 2,
247–258.
C. I. TÎRNĂUCĂ, C. TÎRNĂUCĂ: Learning Regular Tree
Languages from Correction and Equivalence Queries. Journal of Automata, Languages and Combinatorics12 (2007) 4,
501–524.
G. TISCHLER: Properties and Applications of Parametric Weighted Finite
Automata. Journal of Automata, Languages and
Combinatorics10 (2005) 2/3, 347–365.
G. TISCHLER: On
Computability and some Decision Problems of Parametric Weighted Finite
Automata. Journal of Automata, Languages and
Combinatorics12 (2007) 4, 525–544.
I. TOMESCU: Threshold Properties of Some Periodic Factors of Words over a Finite
Alphabet. Journal of Automata, Languages and
Combinatorics13 (2008) 2, 145–156.
S. TURAEV, M. H. SELAMAT, M. OTHMAN: Nonterminal
Complexity of Tree Controlled Grammars Generating Context-Free
Languages. Journal of Automata, Languages and
Combinatorics16 (2011) 1, 55–63.
P. TURAKAINEN: Injectivity of the Quotient h backslash g of two Morphisms and
Ambiguity of Linear Grammars. Journal of Automata,
Languages and Combinatorics6 (2001) 1, 91–96.
S. VÁGVÖLGYI: Recognizing Relations by Tree Automata. Journal of
Automata, Languages and Combinatorics18 (2013) 2, 113–125.
G. VASZIL: Further
Remarks on Parallel Communicating Grammar Systems without a Master. Journal of Automata, Languages and Combinatorics5
(2000) 1, 59–75.
G. VASZIL: Non-returning PC Grammar Systems Generate any Recursively Enumerable
Language with Eight Context-Free Components. Journal
of Automata, Languages and Combinatorics12 (2007) 1/2,
307–315.
A. CERNY: On Fair Words. Journal of Automata, Languages and
Combinatorics14 (2009) 2, 163–174.
Y. VELINOV: Regions of Influence in Simple Decomposition Forms of Finite
Functions. Journal of Automata, Languages and
Combinatorics5 (2000) 3, 355–366.
Y. VELINOV: On the
Regions of Influence in Complex Decomposition Forms of Finite
Functions. Journal of Automata, Languages and
Combinatorics6 (2001) 4, 569–579.
S. VERLAN: On
Minimal Context-Free Insertion-Deletion Systems. Journal of Automata, Languages and Combinatorics12 (2007) 1/2,
317–328.
D.-C. VOINESCU: On the Combinatorial Alphabets of
a Language. Journal of Automata, Languages and
Combinatorics7 (2002) 3, 377–394.
J. WALDMANN: Weighted Automata for Proving Termination of String Rewriting. Journal of Automata, Languages and Combinatorics12
(2007) 4, 545–570.
I. WALUKIEWICZ: Local Logics for Traces. Journal of Automata,
Languages and Combinatorics7 (2002) 2, 259–290.
Z. WANG, F. LIANG, Y. HE, D. YANG: Semiring Structures of some Classes of Hypercodes. Journal of Automata, Languages and Combinatorics14 (2009)
3/4, 259–272.
D. WÄTJEN: Regulations of Uniformly k-Limited ET0L Systems and Their Relations to
Controlled Context-Free Grammars. Journal of Automata,
Languages and Combinatorics1 (1996) 1, 55–74.
D. WÄTJEN: Teams of Limited and Uniformly Limited 0L Systems. Journal of Automata, Languages and Combinatorics4 (1999) 1,
31–57.
D. WÄTJEN: Undecidability Results for Uniformly k-Limited 0L Systems. Journal of Automata, Languages and Combinatorics5 (2000)
2, 159–167.
D. WÄTJEN: Remarks on Simple Eco-Grammar Systems with Prescribed Teams. Journal of Automata, Languages and Combinatorics8 (2003)
1, 85–108.
D. WÄTJEN: Limited Simple Eco-Grammar Systems with Prescribed Teams. Journal of Automata, Languages and Combinatorics11 (2006)
2, 209–231.
D. WÄTJEN: Multi-limited Simple Eco-Grammar Systems with Prescribed Teams. Journal of Automata, Languages and Combinatorics14
(2009) 3/4, 273–296.
D. WÄTJEN, D. OSTROVSKY: Function-Limited 0L Systems Revisited. Journal of
Automata, Languages and Combinatorics6 (2001) 1, 97–114.
P. WEIL: On the
Logical Definability of Certain Graph and Poset Languages. Journal of Automata, Languages and Combinatorics9 (2004) 1,
147–165.
S. YU: State
Complexity of Regular Languages. Journal of Automata,
Languages and Combinatorics6 (2001) 2, 221–234.
L. ZHANG, K. INOUE, A. ITO, Y. WANG: A Leaf-Size Hierarchy of Alternating Rebound Turing
Machines. Journal of Automata, Languages and
Combinatorics7 (2002) 3, 395–410.
L. ZHANG, K.-P. SHUM, S.-L. PENG: Generalized
Prefix Relations and Codes with Finite Decoding Delay. Journal of Automata, Languages and Combinatorics4 (1999) 1,
59–71.
A. ZOLLMANN, K. SIMA'AN: A
Consistent and Efficient Estimator for Data-Oriented Parsing. Journal of Automata, Languages and Combinatorics10 (2005)
2/3, 367–388.