Succinctness of descriptions of SBTA-languages
From MaRDI portal
Publication:1391741
DOI10.1016/S0304-3975(96)00133-8zbMath0901.68131MaRDI QIDQ1391741
Domenico Parente, Jozef Gruska, Angelo Monti, Margherita Napoli
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Completeness results concerning systolic tree automata and E0L languages
- On a family of L languages resulting from systolic tree automata
- Synthesis, structure and power of systolic computations
- A characterization of systolic binary tree automata and applications
- Systolic automata for VLSI on balanced trees
- The state complexities of some basic operations on regular languages
- A Kleene-like characterization of languages accepted by systolic tree automata
- Describing an algorithm by Hopcroft
- Programmable finite automata for VLSI†
- Syntactic monoids in the construction of systolic tree automata
- SYSTOLIC TREE WITH BASE AUTOMATA
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
This page was built for publication: Succinctness of descriptions of SBTA-languages
