Succinct representation of regular languages by Boolean automata. II

DOI10.1016/0304-3975(85)90215-4zbMath0582.68028OpenAlexW4231305083WikidataQ56550598 ScholiaQ56550598MaRDI QIDQ1068549

Ernst L. Leiss

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90215-4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

State-complexity of finite-state devices, state compressibility and incompressibility ⋮ The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic ⋮ Two-way automata and length-preserving homomorphisms ⋮ Descriptional and computational complexity of finite automata -- a survey ⋮ Alternation in two-way finite automata ⋮ Descriptional and Computational Complexity of Finite Automata ⋮ Alternating finite automata and star-free languages ⋮ Concise representations of regular languages by degree and probabilistic finite automata

Cites Work

• Unnamed Item
• On equations for regular languages, finite automata, and sequential networks
• On generalized language equations
• Succinct representation of regular languages by Boolean automata

This page was built for publication: Succinct representation of regular languages by Boolean automata. II