Computing the prefix of an automaton
From MaRDI portal
Recommendations
- Complexity of automata computing values of functions given in the prefix form
- Implementation and Application of Automata
- Prefix pushdown automata and their simplification
- Automata calculating the complexity of automatic sequences
- Prefix-suffix automaton associated with a primitive substitution
- The prefix automaton
- Prefix and Right-Partial Derivative Automata
- Prefix codes, trees, and automata
- Complexity of preimage problems for deterministic finite automata
- Preimage problems for deterministic finite automata
Cites work
- Confluent linear numeration systems
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3653575 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Minimization algorithms for sequential transducers
- The suffix tree of a tree and minimizing sequential transducers
Cited in
(9)- Determinization of transducers over finite and infinite words.
- Minimizing subsequential transducers: a survey.
- Computing covers using prefix tables
- Prefix and Right-Partial Derivative Automata
- Reducing Acyclic Cover Transducers
- scientific article; zbMATH DE number 1059318 (Why is no real title available?)
- Largest common prefix of a regular tree language
- Subsequential transducers: a coalgebraic perspective
- Active learning of deterministic transducers with outputs in arbitrary monoids
This page was built for publication: Computing the prefix of an automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729627)
