Access the full text.
Sign up today, get DeepDyve free for 14 days.
Timothy Griffiths (1968)
The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machinesJ. ACM, 15
M. Weber (1988)
A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence Problem
J. Hopcroft, J. Ullman (1979)
Introduction to Automata Theory, Languages and Computation
(1970)
On formalized computer programs
Benjamín Bedregal (2011)
alfa-ALN: Autômatos Lineares Não-Determinísticos com alfa-TransiçõesTrends in Applied and Computational Mathematics, 12
Rodrigo Souza (2008)
On the Decidability of the Equivalence for k-Valued Transducers
J. Worrell (2013)
Revisiting the Equivalence Problem for Finite Multitape Automata
O. Klima, L. Polak (2012)
On biautomata*, RAIRO - Theor.Inf. Appl., 46
V. Zakharov, S. Jaylauova (2017)
On the Minimization Problem for Sequential ProgramsAutomatic Control and Computer Sciences, 51
R. Alur, Pavol Cerný (2010)
Streaming transducers for algorithmic verification of single-pass list-processing programs
D. Caucal (1989)
A Fast Algorithm to Decide on Simple Grammars Equivalence
A.L. Rosenberg (1967)
175Inf. Control, 10
C. Stirling (2002)
Deciding DPDA Equivalence Is Primitive Recursive
Roussanka Loukanova (2007)
Linear Context Free Languages
E. Ukkonen (1982)
The equivalence problem for some non-real-time deterministic pushdown automataJ. ACM, 29
O. Klíma, L. Polák (2011)
On biautomata
M. Oyamaguchi (1987)
The equivalence problem for real-time DPDAsJ. ACM, 34
O. Ibarra (1978)
The unsolvability of the equivalence problem for ?-free NGSM?s with unary input (output) alphabet and applicationsSIAM J. Comput., 7
J. Hopcroft, R. Karp (1971)
A Linear Algorithm for Testing Equivalence of Finite Automata.
M. Holzer, Sebastian Jakobi (2013)
Minimization and Characterizations for BiautomataFundam. Informaticae, 136
C. Beeri (1976)
An Improvement on Valiant's Decision Procedure for Equivalence of Deterministic Finite Turn Pushdown MachinesTheor. Comput. Sci., 3
Y. Bar-Hillel, M. Perles, E. Shamir (1961)
On formal properties of simple phrase structure grammars, Sprachtypol.Universalienforsch., 14
J. Sakarovitch, Rodrigo Souza (2008)
On the Decidability of Bounded Valuedness for Transducers
Mehryar Mohri (1997)
Finite-State Transducers in Language and Speech ProcessingComput. Linguistics, 23
Tmima Olshansky, A. Pnueli (1977)
A Direct Algorithm for Checking Equivalence of LL(k) GrammarsTheor. Comput. Sci., 4
Marie-Pierre Béal, Olivier Carton, Christophe Prieur, J. Sakarovitch (2000)
Squaring transducers: an efficient procedure for deciding functionality and sequentialityTheor. Comput. Sci., 292
M. Bird (1973)
The Equivalence Problem for Deterministic Two-Tape AutomataJ. Comput. Syst. Sci., 7
E. Gurari, O. Ibarra (1983)
A note on finite-valued and finitely ambiguous transducersMathematical systems theory, 16
Géraud Sénizergues (1997)
The Equivalence Problem for Deterministic Pushdown Automata is Decidable
Meera Blattner (1977)
Single-Valued a-TransducersJ. Comput. Syst. Sci., 15
L. Valiant, M. Paterson (1973)
Deterministic One-Counter Automata
T. Harju, J. Karhumäki (1991)
The Equivalence Problem of Multitape Finite AutomataTheor. Comput. Sci., 78
V. Romanovskii (1986)
The equivalence problem for real-time deterministic pushdown automataCybernetics, 22
M. Weber (1990)
On the valuedness of finite transducersActa Informatica, 27
V. Romanovskii (1980)
Equivalence problem for real-time strict deterministic pushdown automataCybernetics, 16
D. Kozlova, V. Zakharov (2016)
On the Model Checking of Sequential Reactive Systems
M. Schützenberger (1975)
Sur les relations rationnelles
A. Okhotin (2010)
Decision problems for language equationsJ. Comput. Syst. Sci., 76
M. Weber (1993)
Decomposing Finite-Valued Transducers and Deciding Their EquivalenceSIAM J. Comput., 22
M. Holzer, Sebastian Jakobi (2013)
Nondeterministic Biautomata and their Descriptional ComplexityInt. J. Found. Comput. Sci., 25
Rodrigo Souza (2009)
On the Decidability of the Equivalence for a Certain Class of Transducers
Cédric Bastien, J. Czyzowicz, W. Fraczak, W. Rytter (2005)
Prime normal form and equivalence of simple grammarsTheor. Comput. Sci., 363
Y. Hirshfeld, M. Jerrum, F. Moller (1994)
A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free ProcessesTheor. Comput. Sci., 158
Yo-Sub Han, K. Salomaa, D. Wood (2006)
State Complexity of Prefix-Free Regular Languages
V. Itkin (1972)
Logic-term equivalence of program schemataCybernetics, 8
E. Tomita (1984)
An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown AutomataTheor. Comput. Sci., 32
A. Roche-Lima (2012)
012034J. Phys.: Conf. Ser., 341
O. Ibarra (1977)
The unsolvability of the equivalence problem for e-free NGSM's with unary input (output) alphabet and applications18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
P. Fischer, A. Rosenberg (1968)
Multitape One-Way Nonwriting AutomataJ. Comput. Syst. Sci., 2
J. Sakarovitch, Rodrigo Souza (2010)
Lexicographic Decomposition of k-Valued TransducersTheory of Computing Systems, 47
K. Culík, J. Karhumäki (1986)
The Equivalence of Finite Valued Transducers (On HDT0L Languages) is DecidableTheor. Comput. Sci., 47
A. Martelli, U. Montanari (1982)
An Efficient Unification AlgorithmACM Trans. Program. Lang. Syst., 4
V. Zakharov (2010)
Program equivalence checking by two-tape automataCybernetics and Systems Analysis, 46
Ravichandhran Madhavan, M. Mayer, Sumit Gulwani, Viktor Kunčak (2015)
Automating grammar comparisonProceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications
Dean Arden (1961)
Delayed-logic and finite-state machines
M. Linna (1977)
Two Decidability Results for Deterministic Pushdown AutomataJ. Comput. Syst. Sci., 18
Jay Thakkar, Aditya Kanade, R. Alur (2013)
Transducer-Based Algorithmic Verification of Retransmission Protocols over Noisy Channels
J. Sakarovitch, Rodrigo Souza (2008)
On the decomposition of k-valued rational relationsArXiv, abs/0802.2823
B. Bedregal (2011)
?-ALN: Aut�matos lineares n�o-determin�sticos com ?-transi��esTendencias Mat. Apl. Comput., 12
Meera Blattner, T. Head (1979)
The Decidability of Equivalence for Deterministic Finite TransducersJ. Comput. Syst. Sci., 19
Mehryar Mohri (2000)
Minimization algorithms for sequential transducersTheor. Comput. Sci., 234
L. Valiant (1974)
The Equivalence Problem for Deterministic Finite-Turn Pushdown AutomataInf. Control., 25
(1961)
On formal properties of simple phrase structure grammars
D. Rosenkrantz, R. Stearns (1969)
Properties of deterministic top down grammarsProceedings of the first annual ACM symposium on Theory of computing
Géraud Sénizergues (2003)
The Equivalence Problem for t-Turn DPDA Is Co-NP
A. Rosenberg (1967)
A Machine Realization of the Linear Context-Free LanguagesInf. Control., 10
V. Zakharov, G. Temerbekova (2017)
On the Minimization of Finite State Transducers over SemigroupsAutomatic Control and Computer Sciences, 51
J. Karhumäki (1993)
Equations Over Finite Sets of Words and Equivalence Problems in Automata TheoryTheor. Comput. Sci., 108
M. Mohri (1997)
269Comput. Linguist., 23
S. Eilenberg (1974)
Automata, languages, and machines. A
A. Korenjak, J. Hopcroft (1966)
Simple Deterministic Languages
V. Zakharov (2015)
Equivalence Checking Problem for Finite State Transducers over Semigroups
Abiel Roche-Lima, R. Thulasiram (2012)
Bioinformatics algorithm based on a parallel implementation of a machine learning approach using transducersJournal of Physics: Conference Series, 341
D.J. Rosenkrantz, R.E. Stearns (1970)
Properties of deterministic top-down grammarsInf. Control, 17
Hellis Tamm, M. Nykänen, E. Ukkonen (2006)
On size reduction techniques for multitape automataTheor. Comput. Sci., 363
Stanislav Böhm, Stefan Göller (2011)
Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete
Galina Jirásková, O. Klíma (2019)
Deterministic Biautomata and Subclasses of Deterministic Linear Languages
Margus Veanes, Pieter Hooimeijer, B. Livshits, D. Molnar, N. Bjørner (2012)
Symbolic finite state transducers: algorithms and applications
E. Friedman, S. Greibach (1982)
A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State AcceptorsSIAM J. Comput., 11
M. Weber (1992)
On the lengths of values in a finite transducerActa Informatica, 29
E. Friedman (1976)
The Inclusion Problem for Simple LanguagesTheor. Comput. Sci., 1
Finite transducers, two-tape automata, and biautomata are related computational models descended from the concept of finite-state automaton. In these models an automaton controls two heads that read or write symbols on the tapes in the one-way mode. The computations of these three types of automata show many common features, and it is surprising that the methods for analyzing the behavior of automata developed for one of these models do not find suitable utilization in other models. The goal of this paper is to develop a uniform technique for building polynomial-time equivalence checking algorithms for some classes of automata (finite transducers, two-tape automata, biautomata, and single-state pushdown automata) which exhibit certain features of the deterministic or unambiguous behavior. This new technique reduces the equivalence checking of automata to solvability checking of certain systems of equations over the semirings of languages or transductions. It turns out that such a checking can be performed by the variable elimination technique which relies on some combinatorial and algebraic properties of prefix-free regular languages. The main results obtained in this paper are as follows: 1. Using the algebraic approach a new algorithm for checking the equivalence of states of deterministic finite automata is constructed; time complexity of this algorithm is \documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$O(n\;\text{log}\;n)$$\end{document}. 2. A new class of prefix-free finite transducers is distinguished and it is shown that the developed algebraic approach provides the equivalence checking of transducers from this class in quadratic time (for real-time prefix-free transducers) and cubic time (for prefix-free transducers with \documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\varepsilon $$\end{document}-transitions) relative to the size of analyzed machines. 3. It is shown that the equivalence problem for deterministic two-tape finite automata can be reduced to the same problem for prefix-free finite transducers and solved in cubic time relative to the size of the analyzed machines. 4. In the same way it is proved that the equivalence problem for deterministic finite biautomata can be solved in cubic time relative to the size of analyzed machines. 5. By means of the developed approach an efficient equivalence checking algorithm for the class of simple grammars corresponding to deterministic single-state pushdown automata is constructed.
Automatic Control and Computer Sciences – Springer Journals
Published: Dec 1, 2021
Keywords: transducer; two-tape automaton; biatomaton; simple grammar; equivalence checking; prefix-free language; language equation; decision procedure
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.