Kleene Star on Unary Regular Languages

DOI10.1007/978-3-642-39310-5_26zbMath1388.68161OpenAlexW2255673511MaRDI QIDQ2843104

Kristína Čevorová

Publication date: 9 August 2013

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39310-5_26

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

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 ⋮ Operations on Unambiguous Finite Automata ⋮ State complexity of binary coded regular languages ⋮ Operations on Unambiguous Finite Automata ⋮ Self-Verifying Finite Automata and Descriptional Complexity ⋮ The Complexity of Languages Resulting from the Concatenation Operation ⋮ State complexity of binary coded regular languages ⋮ The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)

This page was built for publication: Kleene Star on Unary Regular Languages