Some Minimality Results on Biresidual and Biseparable Automata
From MaRDI portal
Publication:3564897
DOI10.1007/978-3-642-13089-2_48zbMATH Open1284.68367OpenAlexW1561171389MaRDI QIDQ3564897FDOQ3564897
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
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)
- 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
- Bideterministic Automata and Minimal Representations of Regular Languages
- Descriptional complexity of regular languages
- On Transition Minimality of Bideterministic Automata
- Title not available (Why is that?)
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)
