Implementation and Application of Automata

DOI10.1007/b105090zbMath1115.68417WikidataQ56387363 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

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

Related Items

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