On the descriptional complexity of finite automata with modified acceptance conditions

We consider deterministic and nondeterministic finite automata with acceptance conditions that rely on the whole history of a computation on a given word and not only on the last state of the computation under consideration. Formally, these conditions can be seen as the natural analogies of the Buchi and Muller acceptance for finite automata on infinite words. We study the computational power of these new acceptance mechanisms and prove some results on the descriptional complexity of conversions between automata with these new acceptance criteria and finite automata with ordinary acceptance.

[1]  Sheng Yu,et al.  On the state complexity of intersection of regular languages , 1991, SIGA.

[2]  Detlef Wotschke,et al.  Degree-Languages: A New Concept of Acceptance , 1977, J. Comput. Syst. Sci..

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

[4]  David E. Muller,et al.  Infinite sequences and finite machines , 1963, SWCT.

[5]  Lawrence H. Landweber,et al.  Decision problems forω-automata , 1969, Mathematical systems theory.

[6]  Jean-Camille Birget,et al.  Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity , 1993, Theor. Comput. Sci..

[7]  Moshe Y. Vardi,et al.  On omega-Automata and Temporal Logic (Preliminary Report) , 1989, STOC 1989.

[8]  J. R. Büchi.  Symposium on Decision Problems: On a Decision Method in Restricted Second Order Arithmetic , 1966 .

[9]  Sheng Yu,et al.  The State Complexities of Some Basic Operations on Regular Languages , 1994, Theor. Comput. Sci..

[10]  Christof Löding,et al.  Methods for the Transformation of ω-Automata : Complexity and Connection to Second Order Logic , 1998 .

[11]  Robert McNaughton,et al.  Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..

[12]  Karel Culik,et al.  State Complexity of Basic Operations on Finite Languages , 1999, WIA.

[13]  Detlef Wotschke,et al.  Concise representations of regular languages by degree and probabilistic finite automata , 2005, Mathematical systems theory.

[14]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

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

[16]  Robert S. Streett.  Propositional Dynamic Logic of looping and converse , 1981, STOC '81.

[17]  Galina Jirásková,et al.  State Complexity of Some Operations on Regular Languages , 2003, DCFS.

[18]  Moshe Y. Vardi,et al.  On ω-automata and temporal logic , 1989, STOC '89.

[19]  Jeffrey Shallit,et al.  Unary Language Operations, State Complexity and Jacobsthal's Function , 2002, Int. J. Found. Comput. Sci..

[20]  Jeffrey Shallit,et al.  A Lower Bound Technique for the Size of Nondeterministic Finite Automata , 1996, Inf. Process. Lett..

[21]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[22]  A. R. Meyer,et al.  Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[23]  Martin Kutrib,et al.  Unary Language Operations and Their Nondeterministic State Complexity , 2002, Developments in Language Theory.

[24]  Jean-Eric Pin,et al.  Infinite words - automata, semigroups, logic and games , 2004, Pure and applied mathematics series.

[25]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[26]  Martin Kutrib,et al.  State complexity of basic operations on nondeterministic finite automata , 2002, CIAA'02.

[27]  FRANK R. MOORE,et al.  On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata , 1971, IEEE Transactions on Computers.

[28]  Sheng Yu,et al.  State Complexity of Regular Languages , 2001, J. Autom. Lang. Comb..

[29]  Andreas Malcher,et al.  Descriptional Complexity of Machines with Limited Resources , 2002, J. Univers. Comput. Sci..