Square on deterministic, alternating, and Boolean finite automata

DOI10.1007/978-3-319-60252-3_17zbMATH Open1426.68148OpenAlexW2620780249MaRDI QIDQ2401004

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

Publication date: 31 August 2017

Full work available at URL: https://hal.inria.fr/hal-01657005/file/440206_1_En_17_Chapter.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Alternation in two-way finite automata ⋮ Square on Deterministic, Alternating, and Boolean Finite Automata ⋮ Descriptional complexity of regular languages

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Operations on Boolean and alternating finite automata 👍 👎
• On the computability of the set of automorphisms of the unit square 👍 👎
• Automata and square complexes. 👍 👎
• Local Squares, Periodicity and Finite Automata 👍 👎
• On the Square of Regular Languages 👍 👎
• Squares of regular languages 👍 👎
• Square on Deterministic, Alternating, and Boolean Finite Automata 👍 👎

This page was built for publication: Square on deterministic, alternating, and Boolean finite automata