Cited By
View all- Tamm HNykänen MUkkonen E(2006)On size reduction techniques for multitape automataTheoretical Computer Science10.1016/j.tcs.2006.07.027363:2(234-246)Online publication date: 28-Oct-2006
Size reduction of multitape automata
Pages 307 - 318
Abstract
We present a method for size reduction of two-way multitape automata. Our algorithm applies local transformations that change the order in which transitions concerning different tapes occur in the automaton graph, and merge suitable states into a single state. Our work is motivated by implementation of a language for string manipulation in database systems where string predicates are compiled into two-way multitape automata. Additionally, we present a (one-tape) NFA reduction algorithm that is based on a method proposed for DFA minimization by Kameda and Weiner, and apply this algorithm, combined with the multitape automata reduction algorithm, on our multitape automata.
References
[1]
Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Develop. 3 (1959) 114-125
[2]
Harju, T., Karhumäki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science 78 (1991) 347-355
[3]
Grahne, G., Hakli, R., Nykänen, M., Tamm, H., Ukkonen, E.: Design and implementation of a string database query language. Inform. Syst. 28 (2003) 311-337
[4]
Kameda, T., Weiner, P.: On the state minimization of nondeterministic automata. IEEE Trans. Comput. C-19 (1970) 617-627
[5]
Tamm, H.: On minimality and size reduction of one-tape and multitape finite automata. PhD thesis, Department of Computer Science, University of Helsinki, Finland (2004)
[6]
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)
[7]
Ilie, L., Yu, S.: Reducing NFAs by invariant equivalences. Theoretical Computer Science 306 (2003) 373-390
[8]
Ilie, L., Navarro, G., Yu, S.: On NFA reductions. In: Theory is forever. Volume 3113 of Lecture Notes in Computer Science., Springer (2004) 112-124
[9]
Champarnaud, J.M., Coulon, F.: NFA reduction algorithms by means of regular inequalities. Theoretical Computer Science 327 (2004) 241-253
Index Terms
- Size reduction of multitape automata
Index terms have been assigned to the content through auto-classification.
Recommendations
On size reduction techniques for multitape automata
Implementation and application of automataWe present a method for size reduction of two-way multitape automata. Our algorithm applies local transformations that change the order in which transitions concerning different tapes occur in the automaton graph, and merge suitable states into a single ...
On synchronized multitape and multihead automata
DCFS'11: Proceedings of the 13th international conference on Descriptional complexity of formal systemsMotivated by applications to verification problems in string manipulating programs, we look at the problem of whether the heads in a multitape automaton are synchronized. Given an n-tape pushdown automaton M with a one-way read-only head per tape and a ...
Quantum Finite Multitape Automata
SOFSEM '99: Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of InformaticsQuantum finite automata were introduced by C. Moore, J. P. Crutchfield [4], and by A. Kondacs and J. Watrous [3]. This notion is not a generalization of the deterministic finite automata. Moreover, in [3] it was proved that not all regular languages can ...
Comments
Information & Contributors
Information
Published In
Sponsors
- Centre National de la Recherche Scientifique
- Conseil Général des Alpes Maritimes
- UNSA: University of Nice Sophia Antipolis
- EATCS: European Association for Theoretical Computer Science
- INRIA: Institut Natl de Recherche en Info et en Automatique
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 27 June 2005
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024
Other Metrics
Citations
Cited By
View all- Tamm HNykänen MUkkonen E(2006)On size reduction techniques for multitape automataTheoretical Computer Science10.1016/j.tcs.2006.07.027363:2(234-246)Online publication date: 28-Oct-2006
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in