In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language
We present the first (polynomial-time) algorithm for reducing a given deterministic finite state aut...
Finite automata appear in almost every branch of computer science, for example in model checking, in...
Finite automata appear in almost every branch of computer science, for example in model checking, in...
In this work we use a framework of finite-state automata constructions based on equivalences over wo...
In this work we use a framework of finite-state automata constructions based on equivalences over wo...
This paper presents a taxonomy of finite automata minimization algorithms. Brzozowski's elegant...
We provide new insights on the determinization and minimization of treeautomata using congruences on...
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state a...
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state a...
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state a...
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state a...
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state a...
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
AbstractIt is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e....
We present the first (polynomial-time) algorithm for reducing a given deterministic finite state aut...
We present the first (polynomial-time) algorithm for reducing a given deterministic finite state aut...
Finite automata appear in almost every branch of computer science, for example in model checking, in...
Finite automata appear in almost every branch of computer science, for example in model checking, in...
In this work we use a framework of finite-state automata constructions based on equivalences over wo...
In this work we use a framework of finite-state automata constructions based on equivalences over wo...
This paper presents a taxonomy of finite automata minimization algorithms. Brzozowski's elegant...
We provide new insights on the determinization and minimization of treeautomata using congruences on...
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state a...
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state a...
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state a...
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state a...
This paper compares various methods for constructing minimal, deterministic, acyclic, finite-state a...
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
AbstractIt is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e....
We present the first (polynomial-time) algorithm for reducing a given deterministic finite state aut...
We present the first (polynomial-time) algorithm for reducing a given deterministic finite state aut...
Finite automata appear in almost every branch of computer science, for example in model checking, in...
Finite automata appear in almost every branch of computer science, for example in model checking, in...
DOI
Add to ORKG