Implementation and Application of Automata

DOI10.1007/b105090zbMath1115.68417OpenAlexW4302765085WikidataQ56387363 ScholiaQ56387363MaRDI QIDQ5464005

Jean Berstel, Olivier Carton

Publication date: 17 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b105090

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (19)

Morphisms and Minimisation of Weighted Automata ⋮ Tight lower and upper bounds for the complexity of canonical colour refinement ⋮ Lowerbounds for Bisimulation by Partition Refinement ⋮ A graph theoretic approach to automata minimality ⋮ An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton ⋮ On extremal cases of Hopcroft's algorithm ⋮ Hopcroft’s Algorithm and Cyclic Automata ⋮ Forward Bisimulations for Nondeterministic Symbolic Finite Automata ⋮ Standard Sturmian words and automata minimization algorithms ⋮ Hopcroft's algorithm and tree-like automata ⋮ Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm ⋮ Hopcroft’s Minimization Technique: Queues or Stacks? ⋮ Deterministic Pushdown Automata and Unary Languages ⋮ Circular Sturmian words and Hopcroft's algorithm ⋮ On the Hopcroft's minimization technique for DFA and DFCA ⋮ An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton ⋮ On Extremal Cases of Hopcroft’s Algorithm ⋮ Average complexity of Moore's and Hopcroft's algorithms ⋮ Minimisation of automata

This page was built for publication: Implementation and Application of Automata