Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words

We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the case of finite words, where the problem is decidable. Furthermore, we show that it is decidable in doubly exponential time for an automatic relation over infinite words whether it is a recognizable relation. We also revisit this problem in the context of finite words and improve the complexity of the decision procedure to single exponential time. The procedure is based on a polynomial time regularity test for deterministic visibly pushdown automata, which is a result of independent interest.

[1]  Christof Löding,et al.  Regularity Problems for Visibly Pushdown Languages , 2006, STACS.

[2]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[3]  Didier Caucal.  Synchronization of Pushdown Automata , 2006, Developments in Language Theory.

[4]  Rajeev Alur,et al.  Visibly pushdown languages , 2004, STOC '04.

[5]  Nir Piterman,et al.  From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[6]  Parosh Aziz Abdulla.  Regular model checking , 2011, International Journal on Software Tools for Technology Transfer.

[7]  Christof Löding,et al.  On Equivalence and Uniformisation Problems for Finite Transducers , 2016, ICALP.

[8]  Tero Harju,et al.  The Equivalence Problem of Multitape Finite Automata , 1991, Theor. Comput. Sci..

[9]  Pierre Wolper,et al.  An effective decision procedure for linear arithmetic over the integers and reals , 2005, TOCL.

[10]  Andreas Podelski,et al.  Ultimately Periodic Words of Rational w-Languages , 1993, MFPS.

[11]  Wolfgang Thomas.  Infinite Trees and Automation-Definable Relations over omega-Words , 1992, Theor. Comput. Sci..

[12]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

[13]  Malcolm Bird,et al.  The Equivalence Problem for Deterministic Two-Tape Automata , 1973, J. Comput. Syst. Sci..

[14]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

[15]  Stanislav Böhm,et al.  On Büchi One-Counter Automata , 2017, STACS.

[16]  Jirí Srba.  Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation , 2006, CSL.

[17]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[18]  Leslie G. Valiant,et al.  Regularity and Related Problems for Deterministic Pushdown Automata , 1975, JACM.

[19]  Olivier Carton,et al.  Decision problems among the main subfamilies of rational relations , 2006, RAIRO Theor. Informatics Appl..

[20]  Markus Lohrey,et al.  First-order and counting theories of omega-automatic structures , 2006, J. Symb. Log..

[21]  Pierre Wolper,et al.  Omega-Regular Model Checking , 2004, TACAS.

[22]  Richard Edwin Stearns,et al.  A Regularity Test for Pushdown Machines , 1967, Inf. Control..

[23]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[24]  Sophie Pinchinat,et al.  Uniform strategies, rational relations and jumping automata , 2015, Inf. Comput..

[25]  Jacques Sakarovitch,et al.  Synchronized Rational Relations of Finite and Infinite Words , 1993, Theor. Comput. Sci..

[26]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

[27]  Gheorghe Paun,et al.  Thin and Slender Languages , 1995, Discret. Appl. Math..

[28]  Wolfgang Thomas,et al.  Facets of Synthesis: Revisiting Church's Problem , 2009, FoSSaCS.

[29]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[30]  Yunfeng Tao.  Infinity problems and countability problems for omega-automata , 2006, Inf. Process. Lett..

[31]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[32]  Christof Löding,et al.  Regularity Problems for Weak Pushdown ω-Automata and Games , 2012, MFCS.