Operations on automata with all states final

MaRDI QIDQ4994945zbMATH OpenFDO

Authors Kristína Čevorová, Galina Jirásková, Peter Mlynárčik, Matúš Palmovský, Juraj Šebej

Publication date 22 June 2021

Full work available at URL https://arxiv.org/abs/1405.5603, http://eptcs.web.cse.unsw.edu.au/paper.cgi?AFL2014.14

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• Nondeterministic complexity of operations on closed and ideal languages
• Operational state complexity of prefix-free regular languages
• State Complexity of Combined Operations for Prefix-Free Regular Languages
• State complexity of some operations on binary regular languages

Cited in

(9)

• Power, positive closure, and quotients on convex languages
• Nondeterministic complexity in subclasses of convex languages
• Nondeterministic complexity of operations on closed and ideal languages
• Kleene closure and state complexity
• Operations on Self-Verifying Finite Automata
• Transition complexity of incomplete DFAs
• Square on ideal, closed and free languages
• Nondeterministic operational complexity in subregular languages
• Enumerating \(m\)-length walks in directed graphs with constant delay

This page was built for publication: Operations on automata with all states final

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