State complexity of binary coded regular languages

DOI10.1007/978-3-031-13257-5_6OpenAlexW4301523421MaRDI QIDQ2112182

Dominika Pališínová, Viliam Geffert, Alexander Szabari

Publication date: 18 January 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-13257-5_6

zbMATH Keywords

finite automatastate complexityprefix codespromise problemsdon't care automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Binary coded unary regular languages ⋮ State complexity of binary coded regular languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a structural property in the state complexity of projected regular languages
• Optimal state reductions of automata with partially specified behaviors
• Maximal codes with bounded deciphering delay
• Intersection and union of regular languages and state complexity
• Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
• The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)
• Magic numbers in the state hierarchy of finite automata
• Kleene Star on Unary Regular Languages
• MAGIC NUMBERS AND TERNARY ALPHABET
• State Reduction in Incompletely Specified Finite-State Machines

This page was built for publication: State complexity of binary coded regular languages