On the square of regular languages

DOI10.1007/978-3-319-08846-4_10zbMATH Open1302.68155OpenAlexW22759520MaRDI QIDQ3192258FDOQ3192258

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

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

Recommendations

• Square on Deterministic, Alternating, and Boolean Finite Automata
• Square on deterministic, alternating, and Boolean finite automata
• Square, power, positive closure, and complementation on star-free languages
• State complexity of star and square of union of \(k\) regular languages
• State complexity of star of union and square of union on \textit{k} regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (11)

• The Complexity of Languages Resulting from the Concatenation Operation
• POWERS OF REGULAR LANGUAGES
• The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract)
• State complexity of power
• Squares of regular languages
• Square on Deterministic, Alternating, and Boolean Finite Automata
• The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case
• The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)
• Square on deterministic, alternating, and Boolean finite automata
• Some results of Zoltán Ésik on regular languages
• More on the descriptional complexity of products of finite automata

This page was built for publication: On the square of regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192258)