Some Minimality Results on Biresidual and Biseparable Automata

DOI10.1007/978-3-642-13089-2_48MaRDI QIDQ3564897zbMATH OpenOpenAlexFDO

Authors Hellis Tamm

Publication date 26 May 2010

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13089-2_48

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On Transition Minimality of Bideterministic Automata
• ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
• Bideterministic automata and minimal representations of regular languages
• Bideterministic Automata and Minimal Representations of Regular Languages
• scientific article; zbMATH DE number 1163637
• Some remarks on automata minimality
• Minimizing Generalized Büchi Automata
• BISIMULATION MINIMIZATION OF TREE AUTOMATA
• Bisimulation Minimization of Tree Automata
• Minimal realization in bicategories of automata

Cited in

(7)

• scientific article; zbMATH DE number 1688359 (Why is no real title available?)
• Generalization of the double-reversal method of finding a canonical residual finite state automaton
• Lower bound methods for the size of nondeterministic finite automata revisited
• ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
• Descriptional complexity of regular languages
• Bideterministic Automata and Minimal Representations of Regular Languages
• On Transition Minimality of Bideterministic Automata

This page was built for publication: Some Minimality Results on Biresidual and Biseparable Automata

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