On size reduction techniques for multitape automata

DOI10.1016/J.TCS.2006.07.027MaRDI QIDQ860868zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Hellis Tamm, Matti Nykänen, 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)

Recommendations

• Implementation and Application of Automata
• Implementation and Application of Automata
• Theory Is Forever
• Solution of the generalized minimization problem for two-tape automata with one fixed tape
• Reduction of nondeterministic tree automata

Cites work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Combinatorial Pattern Matching
• Design and implementation of a string database query language.
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Implementation and Application of Automata
• Minimal NFA Problems are Hard
• NFA reduction algorithms by means of regular inequalities
• On the State Minimization of Nondeterministic Finite Automata
• Reducing NFAs by invariant equivalences.
• The equivalence problem of multitape finite automata
• Theory Is Forever

Cited in

(3)

• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
• Implementation and Application of Automata
• Implementation and Application of Automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860868)