Square on Deterministic, Alternating, and Boolean Finite Automata

DOI10.1142/S0129054119400318zbMath1427.68147OpenAlexW2974340899WikidataQ127227216 ScholiaQ127227216MaRDI QIDQ5205045

Ivana Krajňáková, Galina Jirásková

Publication date: 10 December 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054119400318

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Operations on Boolean and Alternating Finite Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On equations for regular languages, finite automata, and sequential networks
• The state complexity of \(L^{2}\) and \(L^k\)
• State complexity of power
• Succinct representation of regular languages by Boolean automata
• The state complexities of some basic operations on regular languages
• Descriptional Complexity of Operations on Alternating and Boolean Automata
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
• On the Square of Regular Languages
• Constructions for alternating finite automata^∗

This page was built for publication: Square on Deterministic, Alternating, and Boolean Finite Automata