Developments in Language Theory

s of Invited Talks Recognisable Languages Over Monads

[1]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[2]  Jacques Stern,et al.  Complexity of Some Problems from the Theory of Automata , 1985, Inf. Control..

[3]  Shenggen Zheng,et al.  On the state complexity of semi-quantum finite automata , 2014, RAIRO Theor. Informatics Appl..

[4]  A. C. Cem Say,et al.  Unbounded-error quantum computation with small space bounds , 2010, Inf. Comput..

[5]  Masaki Nakanishi,et al.  Quantum versus Classical Pushdown Automata in Exact Computation , 2005 .

[6]  James P. Crutchfield,et al.  Quantum automata and quantum grammars , 2000, Theor. Comput. Sci..

[7]  Masaki Nakanishi.  Quantum Pushdown Automata with a Garbage Tape , 2015, SOFSEM.

[8]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[9]  Jacques Justin,et al.  Episturmian words: a survey , 2008, RAIRO Theor. Informatics Appl..

[10]  Marcel Paul Schützenberger,et al.  On Finite Monoids Having Only Trivial Subgroups , 1965, Inf. Control..

[11]  A. C. Cem Say,et al.  Quantum Finite Automata: A Modern Introduction , 2014, Computing with New Resources.

[12]  Dung T. Huynh,et al.  Finite-Automaton Aperiodicity is PSPACE-Complete , 1991, Theor. Comput. Sci..

[13]  Denis Thérien,et al.  Complete Classifications for the Communication Complexity of Regular Languages , 2005, Theory of Computing Systems.

[14]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[15]  Thomas Colcombet,et al.  Green's Relations and Their Use in Automata Theory , 2011, LATA.

[16]  A. C. Cem Say,et al.  Languages recognized by nondeterministic quantum finite automata , 2009, Quantum Inf. Comput..

[17]  Christophe Reutenauer,et al.  A $$d$$d-dimensional Extension of Christoffel Words , 2015, Discret. Comput. Geom..

[18]  Barry Simon,et al.  Singular continuous spectrum for palindromic Schrödinger operators , 1995 .

[19]  Raymond E. Miller,et al.  Varieties of Formal Languages , 1986 .

[20]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[21]  Oleg E. Melnik,et al.  Encyclopedia of Complexity and Systems Science , 2008 .

[22]  Aviezri S. Fraenkel,et al.  How Many Squares Can a String Contain? , 1998, J. Comb. Theory, Ser. A.

[23]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[24]  Abuzer Yakaryilmaz,et al.  Implications of Quantum Automata for Contextuality , 2014, CIAA.

[25]  Carlo Mereghetti,et al.  Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata , 2001, RAIRO Theor. Informatics Appl..

[26]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).