Theory of átomata

DOI10.1016/j.tcs.2014.04.016zbMath1359.68160OpenAlexW1768118166MaRDI QIDQ2453119

Hellis Tamm, Janusz A. Brzozowski

Publication date: 6 June 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.016

zbMATH Keywords

atomregular languageNFAleft quotientátomatonatomic NFAminimization by double reversal

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (25)

Quotients and atoms of reversible languages ⋮ Syntactic complexity of bifix-free languages ⋮ Complexity of suffix-free regular languages ⋮ Complexity of Suffix-Free Regular Languages ⋮ Duality of Lattices Associated to Left and Right Quotients ⋮ Nondeterministic syntactic complexity ⋮ Forward Bisimulations for Nondeterministic Symbolic Finite Automata ⋮ Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages ⋮ Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited ⋮ Unnamed Item ⋮ Syntactic complexity of regular ideals ⋮ Most Complex Non-Returning Regular Languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Complexity of bifix-free regular languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Complexity of bifix-free regular languages ⋮ A congruence-based perspective on automata minimization algorithms ⋮ Unrestricted State Complexity of Binary Operations on Regular Languages ⋮ Syntactic complexity of bifix-free regular languages ⋮ Descriptional complexity of regular languages ⋮ Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton ⋮ Unnamed Item ⋮ DFA minimization: double reversal versus split minimization algorithms ⋮ Yet another canonical nondeterministic automaton ⋮ A Congruence-Based Perspective on Finite Tree Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial double reversal minimization algorithm for deterministic finite automata
• Intersection and union of regular languages and state complexity
• Theory of Átomata
• Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata
• Experimental Evaluation of Classical Automata Constructions
• COMPLEXITY OF ATOMS OF REGULAR LANGUAGES
• On the State Minimization of Nondeterministic Finite Automata

This page was built for publication: Theory of átomata