On size reduction techniques for multitape automata

DOI10.1016/j.tcs.2006.07.027zbMath1153.68033DBLPjournals/tcs/TammNU06OpenAlexW2043268408WikidataQ58054180 ScholiaQ58054180MaRDI QIDQ860868

Matti Nykänen, Hellis Tamm, Esko Ukkonen

Publication date: 9 January 2007

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

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

zbMATH Keywords

multitape automatanondeterministic finite automatasize reduction

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines

Cites Work

• Unnamed Item
• Unnamed Item
• NFA reduction algorithms by means of regular inequalities
• The equivalence problem of multitape finite automata
• Design and implementation of a string database query language.
• Reducing NFAs by invariant equivalences.
• Minimal NFA Problems are Hard
• On the State Minimization of Nondeterministic Finite Automata
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Combinatorial Pattern Matching
• Theory Is Forever
• Implementation and Application of Automata

This page was built for publication: On size reduction techniques for multitape automata