On the Square of Regular Languages

DOI10.1007/978-3-319-08846-4_10zbMath1302.68155OpenAlexW22759520MaRDI QIDQ3192258

Ivana Krajňáková, Galina Jirásková, Kristína Čevorová

Publication date: 26 September 2014

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08846-4_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract) ⋮ The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case ⋮ Square on Deterministic, Alternating, and Boolean Finite Automata ⋮ The Complexity of Languages Resulting from the Concatenation Operation ⋮ More on the descriptional complexity of products of finite automata ⋮ The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)

This page was built for publication: On the Square of Regular Languages