Characterizations and computational complexity of systolic trellis automata
From MaRDI portal
(Redirected from Publication:792091)
Recommendations
- Systolic trellis automata: Stability, decidability and complexity
- scientific article; zbMATH DE number 4030987
- Systolic trellis automatat†
- SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA
- scientific article; zbMATH DE number 4126708
- Systolic trellis automatata †
- Some computational limits of trellis automata
- scientific article; zbMATH DE number 17546
- scientific article; zbMATH DE number 3898246
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3628373 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- Abstract families of deterministic languages
- An Approach to a Unified Theory of Automata
- An observation on time-storage trade off
- Relationships between nondeterministic and deterministic tape complexities
- Storage requirements for deterministic polynomial time recognizable languages
- Systolic automata for VLSI on balanced trees
- Systolic trellis automata: Stability, decidability and complexity
- Systolic trellis automatat†
Cited in
(41)- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- On the equivalence of linear conjunctive grammars and trellis automata
- Synthesis, structure and power of systolic computations
- The complexity of systolic dissemination of information in interconnection networks
- On some open problems concerning the complexity of cellular arrays
- A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS
- scientific article; zbMATH DE number 4078801 (Why is no real title available?)
- Boolean grammars and gsm mappings
- Input-driven languages are linear conjunctive
- On the computational power of totalistic cellular automata
- Comparing linear conjunctive languages to subfamilies of the context-free languages
- scientific article; zbMATH DE number 17546 (Why is no real title available?)
- scientific article; zbMATH DE number 3898246 (Why is no real title available?)
- Power of interconnections and of nondeterminism in regularY-tree systolic automata
- Some computational limits of trellis automata
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages
- scientific article; zbMATH DE number 4215381 (Why is no real title available?)
- Language equations
- Nondeterministic, probabilistic and alternating computations on cellular array models
- Boolean grammars
- Expressive power of \(\text{LL}(k)\) Boolean grammars
- Systolic trellis automata: Stability, decidability and complexity
- On the number of nonterminals in linear conjunctive grammars
- Unambiguous Boolean grammars
- On iterative and cellular tree arrays
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- On hardest languages for one-dimensional cellular automata
- A simple P-complete problem and its language-theoretic representations
- Linear grammars with one-sided contexts and their automaton representation
- Parallel parsing on a one-way linear array of finite-state machines
- scientific article; zbMATH DE number 3940733 (Why is no real title available?)
- The Boolean closure of linear context-free languages
- Unambiguous conjunctive grammars over a one-symbol alphabet
- On spiking neural P systems
- Fast parallel language recognition by cellular automata
- A property of real-time trellis automata
- Non-deterministic cellular automata and languages
- On hardest languages for one-dimensional cellular automata
- Linear-space recognition for grammars with contexts
- scientific article; zbMATH DE number 4126708 (Why is no real title available?)
This page was built for publication: Characterizations and computational complexity of systolic trellis automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792091)
