Transition complexity of incomplete DFAs

zbMATH Open1455.68090arXiv1008.1652MaRDI QIDQ4964014FDOQ4964014

Authors: Yuan Gao, Kai Salomaa, Sheng Yu 

Publication date: 24 February 2021

Full work available at URL: https://arxiv.org/abs/1008.1652

Recommendations

• Transition complexity of incomplete DFAs
• Incomplete operational transition complexity of regular languages
• Incomplete transition complexity of some basic operations
• Incomplete transition complexity of basic operations on finite languages
• Operations on automata with all states final

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (7)

• Incomplete transition complexity of basic operations on finite languages
• Incomplete transition complexity of some basic operations
• Transition complexity of language operations
• Transition complexity of incomplete DFAs
• State complexity of projected languages
• Incomplete operational transition complexity of regular languages
• Lower Bounds for the Transition Complexity of NFAs

This page was built for publication: Transition complexity of incomplete DFAs

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