State complexity of SBTA languages

DOI10.1007/3-540-59175-3_101zbMath1495.68122OpenAlexW1516182645MaRDI QIDQ5096343

Margherita Napoli, Jozef Gruska, Domenico Parente, Angelo Monti

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_101

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Synthesis, structure and power of systolic computations
• A characterization of systolic binary tree automata and applications
• C-tree systolic automata
• Systolic automata for VLSI on balanced trees
• The state complexities of some basic operations on regular languages
• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: State complexity of SBTA languages