Publication | Date of Publication | Type |
---|
Parallel pattern generation with one-way communications | 2024-01-29 | Paper |
Iterative devices generating infinite words | 2022-08-18 | Paper |
On the equivalence problem for deterministic multitape automata and transducers | 2022-08-16 | Paper |
Finite state transformations of images | 2019-01-10 | Paper |
An aperiodic set of Wang cubes | 2017-11-16 | Paper |
Aspects of Molecular Computing | 2009-05-14 | Paper |
A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM | 2005-06-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4737905 | 2004-08-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4474150 | 2004-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4520306 | 2001-02-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q4942260 | 2000-07-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4320646 | 2000-06-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4941170 | 2000-02-29 | Paper |
ITERATIVE DEVICES GENERATING INFINITE WORDS | 1998-11-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4371018 | 1998-02-22 | Paper |
Computational fractal geometry with WFA | 1997-12-14 | Paper |
Implementing Daubechies wavelet transform with weighted finite automata | 1997-11-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4347954 | 1997-11-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4358454 | 1997-09-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4332367 | 1997-02-13 | Paper |
An aperiodic set of 13 Wang tiles | 1997-01-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4890444 | 1996-08-25 | Paper |
Iterative weighted finite transductions | 1995-12-14 | Paper |
On the power of L-systems in image generation | 1995-08-27 | Paper |
Weighted finite transducers in image processing | 1995-05-17 | Paper |
Finite Automata Computing Real Functions | 1994-10-17 | Paper |
Parametrized recurrent systems for image generation | 1994-09-25 | Paper |
\(L\)-systems and mutually recursive function systems | 1994-06-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4281536 | 1994-04-07 | Paper |
ENCODING IMAGES AS WORDS AND LANGUAGES | 1993-11-01 | Paper |
Affine automata and related techniques for generation of complex images | 1993-10-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4036597 | 1993-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4036760 | 1993-05-18 | Paper |
Rational and affine expressions for image description | 1993-05-16 | Paper |
The topological entropy of cellular automata is uncomputable | 1993-02-18 | Paper |
An efficient solution of the firing mob problem | 1992-06-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q3979257 | 1992-06-26 | Paper |
Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems | 1992-06-26 | Paper |
Splicing semigroups of dominoes and DNA | 1992-06-25 | Paper |
Computation theoretic aspects of cellular automata | 1990-01-01 | Paper |
Formal languages and global cellular automaton behavior | 1990-01-01 | Paper |
New techniques for proving the decidability of equivalence problem | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3355259 | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3359803 | 1990-01-01 | Paper |
Loops in automata and HDTOL relations | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4205087 | 1989-01-01 | Paper |
HDTOL matching of computations of multitape automata | 1989-01-01 | Paper |
Variations of the firing squad problem and applications | 1989-01-01 | Paper |
On the Limit Sets of Cellular Automata | 1989-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3358249 | 1989-01-01 | Paper |
On totalistic systolic networks | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3793751 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3805907 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3813316 | 1988-01-01 | Paper |
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3771622 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3776665 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3782819 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3789092 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3802629 | 1987-01-01 | Paper |
Fault-tolerant schemes for some systolic systems | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3805906 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4728263 | 1986-01-01 | Paper |
A note on the equivalence problem of rational formal power series | 1986-01-01 | Paper |
Real-time, pseudo real-time, and linear-time ITA | 1986-01-01 | Paper |
The equivalence of finite valued transducers (on HDT0L languages) is decidable | 1986-01-01 | Paper |
Synchronizable deterministic pushdown automata and the decidability of their equivalence | 1986-01-01 | Paper |
Systolic trellis automata: Stability, decidability and complexity | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3711770 | 1986-01-01 | Paper |
Iterative tree arrays with logarithmic depth† | 1986-01-01 | Paper |
Topological transformations as a tool in the design of systolic networks | 1985-01-01 | Paper |
On real-time cellular automata and trellis automata | 1984-01-01 | Paper |
Context-free complexity of finite languages | 1984-01-01 | Paper |
Iterative tree automata | 1984-01-01 | Paper |
On extendibility of unavoidable sets | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3339293 | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3343464 | 1984-01-01 | Paper |
Systolic trellis automatata † | 1984-01-01 | Paper |
Systolic trellis automatat† | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3687724 | 1984-01-01 | Paper |
The ω sequence problem for DOL systems is decidable | 1984-01-01 | Paper |
Transductions and the parallel generation of languages† | 1983-01-01 | Paper |
Systems of equations over a free monoid and Ehrenfeucht's conjecture | 1983-01-01 | Paper |
Folding of the plane and the design of systolic arrays | 1983-01-01 | Paper |
On a family of L languages resulting from systolic tree automata | 1983-01-01 | Paper |
Systolic automata for VLSI on balanced trees | 1983-01-01 | Paper |
Programmable finite automata for VLSI† | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3309090 | 1983-01-01 | Paper |
Ambiguity and decision problems concerning number systems | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3334093 | 1983-01-01 | Paper |
Properties of Finite and Pushdown Transducers | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3705510 | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3945604 | 1982-01-01 | Paper |
Tree correspondence problems | 1982-01-01 | Paper |
A homomorphic characterization of regular languages | 1982-01-01 | Paper |
A note on some tree similarity measures | 1982-01-01 | Paper |
On infinite words obtained by iterating morphisms | 1982-01-01 | Paper |
Dominoes over a free monoid | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3326872 | 1982-01-01 | Paper |
Test sets for context free languages and algebraic systems of equations over a free monoid | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3940850 | 1982-01-01 | Paper |
A note on recurrent words | 1981-01-01 | Paper |
Concise description of finite languages | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3219095 | 1981-01-01 | Paper |
Dense multiway trees | 1981-01-01 | Paper |
Equivalence problems for mappings on infinite strings | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3933776 | 1981-01-01 | Paper |
Test sets and checking words for homomorphism equivalence | 1980-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3886896 | 1980-01-01 | Paper |
A homomorphic characterization of time and space complexity classes of languages† | 1980-01-01 | Paper |
Test sets for homomorphism equivalence on context free languages | 1980-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3901701 | 1980-01-01 | Paper |
GROWING CELLULAR SYSTEMS: GENERATION OF GRAPHS BY PARALLEL REWRITING | 1979-01-01 | Paper |
A Purely Homomorphic Characterization of Recursively Enumerable Sets | 1979-01-01 | Paper |
Homomorphism equivalence on etol languages† | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4199550 | 1979-01-01 | Paper |
Some decidability results about regular and pushdown translations | 1979-01-01 | Paper |
Secure information storage and retrieval using new results in cryptography | 1979-01-01 | Paper |
A mathematical investigation of propagating graph 0L systems | 1979-01-01 | Paper |
Interactive L systems with almost interactionless behaviour | 1979-01-01 | Paper |
Doubly deterministic tabled OL systems | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3870326 | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3906444 | 1979-01-01 | Paper |
Propagating chain-free normal forms for EOL systems | 1978-01-01 | Paper |
String representations of graphs | 1978-01-01 | Paper |
Speed-varying OL systems | 1978-01-01 | Paper |
Isomorphism, form equivalence and sequence equivalence of PDOL forms | 1978-01-01 | Paper |
The decidability of v-local catenativity and of other properties of DOL systems | 1978-01-01 | Paper |
On two-symbol complete EOL forms | 1978-01-01 | Paper |
The ultimate equivalence problem for DOL systems | 1978-01-01 | Paper |
On the decidability of homomorphism equivalence for languages | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4124338 | 1977-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4138643 | 1977-01-01 | Paper |
The decidability of the equivalence problem for DOL-systems | 1977-01-01 | Paper |
On the decidability of the sequence equivalence problem for DOL-systems | 1977-01-01 | Paper |
Tree controlled grammars | 1977-01-01 | Paper |
PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT† | 1976-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4065055 | 1975-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4095895 | 1975-01-01 | Paper |
On some families of languages related to developmental systems | 1974-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4048614 | 1974-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4775490 | 1974-01-01 | Paper |
A model for the formal definition of programming languages | 1973-01-01 | Paper |
LR-regular grammars - an extension of LR(k) grammars | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5633661 | 1971-01-01 | Paper |
Abstract families of relations | 1971-01-01 | Paper |
Classification of noncounting events | 1971-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5590063 | 1970-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5556438 | 1968-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5528649 | 1967-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5537619 | 1967-01-01 | Paper |
Construction of the automaton mapping | 1965-01-01 | Paper |