Language and Automata Theory and Applications: 14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings

We survey recent developments related to the Minimum Circuit Size Problem.

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

[2]  Jean Néraud.  Completing circular codes in regular submonoids , 2008, Theor. Comput. Sci..

[3]  Nivat G. Päun,et al.  Handbook of Formal Languages , 2013, Springer Berlin Heidelberg.

[4]  Howard Straubing,et al.  Some results on C-varieties , 2005, RAIRO Theor. Informatics Appl..

[5]  A. I. Shirshov.  Subalgebras of Free Lie Algebras , 2009 .

[6]  James Rogers,et al.  Aural Pattern Recognition Experiments and the Subregular Hierarchy , 2011, J. Log. Lang. Inf..

[7]  Juha Kärkkäinen,et al.  On the Size of Lempel-Ziv and Lyndon Factorizations , 2017, STACS.

[8]  Kevin Knight,et al.  Applications of Weighted Automata in Natural Language Processing , 2009 .

[9]  Pavel Pudlák,et al.  On the computational power of depth 2 circuits with threshold and modulo gates , 1994, STOC '94.

[10]  Martin Kutrib,et al.  Complexity of multi-head finite automata: Origins and directions , 2011, Theor. Comput. Sci..

[11]  Nathan Grosshans.  The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids. (Les limites de la méthode de Nečiporuk et le pouvoir des programmes sur monoïdes issus de petites variétiés de monoïdes finis) , 2018 .

[12]  Olivier Carton,et al.  On the continuity set of an Omega rational function , 2008, RAIRO Theor. Informatics Appl..

[13]  A. A. LEMAN,et al.  THE REDUCTION OF A GRAPH TO CANONICAL FORM AND THE ALGEBRA WHICH APPEARS THEREIN , 2018 .

[14]  Jean Berstel,et al.  Recognizable Formal Power Series on Trees , 1982, Theor. Comput. Sci..

[15]  Arto Salomaa.  Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa , 1999, Jewels are Forever.

[16]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[17]  Roberto Grossi,et al.  On the Complexity of String Matching for Graphs , 2023, ICALP.

[18]  Tony Tan.  Extending two-variable logic on data trees with order on data values and its automata , 2014, ACM Trans. Comput. Log..

[19]  Alessandro Warth,et al.  Recognising and Generating Terms using Derivatives of Parsing Expression Grammars , 2018, ArXiv.

[20]  Kristoffer Arnsfelt Hansen,et al.  Exact Threshold Circuits , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[21]  Thomas Place,et al.  Going Higher in First-Order Quantifier Alternation Hierarchies on Words , 2017, J. ACM.

[22]  Albert R. Meyer,et al.  A Note on Star-Free Events , 1969, JACM.

[23]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[24]  C. Michaux,et al.  LOGIC AND p-RECOGNIZABLE SETS OF INTEGERS , 1994 .

[25]  M. Schützenberger,et al.  Sur Le Produit De Concatenation Non Ambigu , 1976 .

[26]  Robert R. Rubalcaba.  Fractional Domination, Fractional Packings, and Fractional Isomorphisms of Graphs , 2005 .

[27]  K. N. King.  Measures of parallelism in alternating computation trees (Extended Abstract) , 1981, STOC '81.

[28]  Zsuzsanna Lipták,et al.  On Prefix Normal Words , 2011, Developments in Language Theory.

[29]  Marcin Mucha,et al.  Lyndon Words and Short Superstrings , 2012, SODA.

[30]  Michal Kunc,et al.  Regular solutions of language inequalities and well quasi-orders , 2005, Theor. Comput. Sci..

[31]  Véronique Bruyère,et al.  On Completion of Codes with Finite Deciphering Delay , 1990, Eur. J. Comb..

[32]  S. Rao Kosaraju.  Correction to "Regularity preserving functions" , 1974, SIGA.

[33]  Anton Cerný,et al.  Several extensions of the Parikh matrix L-morphism , 2013, J. Comput. Syst. Sci..

[34]  Diego Calvanese,et al.  Verification of Evolving Graph-structured Data under Expressive Path Constraints , 2016, ICDT.

[35]  HaddadSerge,et al.  Model Checking Timed and Stochastic Properties with CSL^{TA} , 2009 .

[36]  Yoshinori Yamaguchi,et al.  Packrat parsers can handle practical grammars in mostly constant space , 2010, PASTE '10.

[37]  Juris Hartmanis.  On non-determinancy in simple computing devices , 2004, Acta Informatica.

[38]  Kai Salomaa,et al.  Nondeterminism Growth and State Complexity , 2019, DCFS.

[39]  Flavio D'Alessandro,et al.  Well Quasi-orders in Formal Language Theory , 2008, Developments in Language Theory.

[40]  Nathanaël Fijalkow,et al.  The State Complexity of Alternating Automata , 2018, LICS.

[41]  Sebastian Bala.  Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms , 2005, Theory of Computing Systems.

[42]  Michal Skrzypczak,et al.  Monadic Second Order Logic with Measure and Category Quantifiers , 2018, Log. Methods Comput. Sci..

[43]  Shlomo Moran,et al.  Non Deterministic Polynomial Optimization Problems and their Approximations , 1977, Theor. Comput. Sci..

[44]  Markus Holzer,et al.  Automata That Take Advice , 1995, MFCS.

[45]  J. Gimbel,et al.  Approximations of the domination number of a graph , 2017, 1701.05961.

[46]  Aaron Moss.  Derivatives of Parsing Expression Grammars , 2017, AFL.

[47]  Anuj Dawar,et al.  Definable Inapproximability: New Challenges for Duplicator , 2018, CSL.

[48]  Raffaele Giancarlo,et al.  On the Determinization of Weighted Finite Automata , 2000, SIAM J. Comput..

[49]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[50]  Aaron Lye,et al.  Transformation of Turing Machines into Context-Dependent Fusion Grammars , 2019, GCM@STAF.

[51]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

[52]  Thomas Place,et al.  Separation for dot-depth two , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[53]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[54]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[55]  Christoph Haase,et al.  On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields , 2019, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[56]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[57]  Denis Thérien,et al.  NC1: The automata-theoretic viewpoint , 1991, computational complexity.

[58]  Claire David,et al.  On the Satisfiability of Two-Variable Logic over Data Words , 2010, LPAR.

[59]  Jean Mairesse,et al.  Modeling and analysis of timed Petri nets using heaps of pieces , 1997, 1997 European Control Conference (ECC).

[60]  S. Seshu,et al.  Introduction to the theory of finite-state machines , 1963 .

[61]  Kalpana Mahalingam,et al.  Some Algebraic Aspects of Parikh q-Matrices , 2016, Int. J. Found. Comput. Sci..

[62]  Bryan Ford,et al.  Packet parsing : a practical linear-time algorithm with backtracking , 2002 .

[63]  Wen Chean Teh,et al.  A New Operator over Parikh Languages , 2016, Int. J. Found. Comput. Sci..

[64]  Kazuya Tsuruta,et al.  The "Runs" Theorem , 2017, SIAM J. Comput..

[65]  Pierre Wolper,et al.  On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract) , 1998, ICALP.

[66]  Janusz A. Brzozowski,et al.  Characterizations of locally testable events , 1971, Discret. Math..

[67]  Ion Petre,et al.  Parikh matrices and amiable words , 2008, Theor. Comput. Sci..

[68]  Jorge Almeida,et al.  Finite Semigroups and Universal Algebra , 1995 .

[69]  Raphael Yuster.  Integer and fractional packing of families of graphs , 2005, Random Struct. Algorithms.

[70]  Mahesh Viswanathan,et al.  Decidable and Expressive Classes of Probabilistic Automata , 2015, FoSSaCS.

[71]  Wen Chean Teh,et al.  Strong 2.t and Strong 3.t Transformations for Strong M-equivalence , 2019, Int. J. Found. Comput. Sci..

[72]  Kazuya Tsuruta,et al.  A new characterization of maximal repetitions by Lyndon trees , 2015, SODA.

[73]  Martin Otto,et al.  On Logics with Two Variables , 1999, Theor. Comput. Sci..

[74]  Jörg Endrullis,et al.  Mix-Automatic Sequences , 2013, LATA.

[75]  K. N. King.  Iteration Theorems for Families of Strict Deterministic Languages , 1980, Theor. Comput. Sci..

[76]  Marco Beccuti,et al.  Expressing and Computing Passage Time Measures of GSPN Models with HASL , 2013, Petri Nets.

[77]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[78]  Dong Kyue Kim,et al.  String Matching in Hypertext , 1995, CPM.

[79]  Gonzalo Navarro,et al.  Improved approximate pattern matching on hypertext , 1998, Theor. Comput. Sci..

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

[81]  Jarkko Kari,et al.  Image compression using weighted finite automata , 1993, Comput. Graph..

[82]  Véronique Terrier,et al.  Closure properties of cellular automata , 2006, Theor. Comput. Sci..

[83]  Kimio Kuramitsu.  Packrat Parsing with Elastic Sliding Window , 2015, J. Inf. Process..

[84]  Ondrej Klíma,et al.  Hierarchies of Piecewise Testable Languages , 2008, Developments in Language Theory.

[85]  Paul Gastin,et al.  First-order definable languages , 2008, Logic and Automata.

[86]  Thomas Place,et al.  On all things star-free , 2019, ICALP.

[87]  Bernd Finkbeiner,et al.  Checking Finite Traces Using Alternating Automata , 2004, Formal Methods Syst. Des..

[88]  ARTO SALOMAA,et al.  Subword Occurrences, Parikh Matrices and Lyndon Images , 2010, Int. J. Found. Comput. Sci..

[89]  Erhan Öztop,et al.  Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions , 2015, Neural Computation.

[90]  Jeffrey Shallit,et al.  Decidability and Enumeration for Automatic Sequences: A Survey , 2013, CSR.

[91]  Carla Savage,et al.  A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..

[92]  J. Zwart.  The Minimalist Program , 1998, Journal of Linguistics.

[93]  A. C. Cem Say,et al.  Finite state verifiers with constant randomness , 2014, Log. Methods Comput. Sci..

[94]  Carl Jesse Pollard,et al.  Generalized phrase structure grammars, head grammars, and natural language , 1984 .

[95]  Burkhard Monien.  Transformational methods and their application to complexity problems , 1976, Acta Informatica.

[96]  N. Lam.  Finite Maximal Infix Codes , 2000 .

[97]  Anuj Dawar,et al.  The nature and power of fixed-point logic with counting , 2015, SIGL.

[98]  Orna Kupferman,et al.  Counting with Automata , 1999 .

[99]  Sebastian Maneth,et al.  Efficient memory representation of XML document trees , 2008, Inf. Syst..

[100]  Dmitry Berdinsky,et al.  Measuring Closeness Between Cayley Automatic Groups and Automatic Groups , 2018, LATA.

[101]  Nguyen Huong Lam.  Finite maximal solid codes , 2001, Theor. Comput. Sci..

[102]  Thomas Place,et al.  Generic Results for Concatenation Hierarchies , 2018, Theory of Computing Systems.

[103]  Stefan Kratsch,et al.  Kernel bounds for path and cycle problems , 2011, Theor. Comput. Sci..

[104]  Denis Thérien,et al.  Programs over semigroups of dot-depth one , 2000, Theor. Comput. Sci..

[105]  Rusins Freivalds,et al.  Amount of nonconstructivity in deterministic finite automata , 2010, Theor. Comput. Sci..

[106]  Helmut Seidl,et al.  Minimization of Deterministic Bottom-Up Tree Transducers , 2010, Developments in Language Theory.

[107]  David Haussler,et al.  On Total Regulators Generated by Derivation Relations , 1985, ICALP.

[108]  Ohad Shamir,et al.  The Power of Depth for Feedforward Neural Networks , 2015, COLT.

[109]  Thomas Place,et al.  Going Higher in the First-Order Quantifier Alternation Hierarchy on Words , 2014, ICALP.

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

[111]  Véronique Bruyère,et al.  On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases , 2008, ICALP.

[112]  Olivier Finkel,et al.  Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language , 2011, Int. J. Found. Comput. Sci..

[113]  C. Cobeli,et al.  ON THE DISCRETE LOGARITHM PROBLEM , 2008, 0811.4182.

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

[115]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

[116]  Marek Chrobak,et al.  Finite Automata and Unary Languages , 1986, Theor. Comput. Sci..

[117]  Thomas Graf,et al.  C-Command Dependencies as TSL String Constraints , 2019 .

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

[119]  Denis Thérien,et al.  Finite monoids and the fine structure of NC1 , 1987, STOC.

[120]  Jacques Sakarovitch,et al.  Une Application de la Representation Matricielle des Transductions , 1985, Theor. Comput. Sci..

[121]  Roman R. Redziejowski.  Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking , 2007, Fundam. Informaticae.

[122]  Veikko Keränen,et al.  Abelian Squares are Avoidable on 4 Letters , 1992, ICALP.

[123]  P. Pevzner,et al.  An Eulerian path approach to DNA fragment assembly , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[124]  Daniel Götzmann.  Multiple Context-Free Grammars , 2007 .

[125]  Ernst L. Leiss,et al.  Succint Representation of Regular Languages by Boolean Automata , 1981, Theor. Comput. Sci..

[126]  Dieter Hofbauer,et al.  Deleting string rewriting systems preserve regularity , 2004, Theor. Comput. Sci..

[127]  Peter Weiner,et al.  An infinite hierarchy of intersections of context-free languages , 1973, Mathematical systems theory.

[128]  Thomas Place,et al.  Separating regular languages with first-order logic , 2014, CSL-LICS.

[129]  Antonio Restivo,et al.  On generalized Lyndon words , 2018, Theor. Comput. Sci..

[130]  Wim Martens,et al.  Efficient Separability of Regular Languages by Subsequences and Suffixes , 2013, ICALP.

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

[132]  Peter M. Higgins.  A New Proof of Schutzenberger's Theorem , 2000, Int. J. Algebra Comput..

[133]  Michael Mortimer,et al.  On languages with two variables , 1975, Math. Log. Q..

[134]  S. Ginsburg,et al.  BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[135]  Paolo Ballarini,et al.  HASL: A new approach for performance evaluation and model checking from concepts to experimentation , 2015, Perform. Evaluation.

[136]  Richard Královic,et al.  Determinism and Nondeterminism in Finite Automata with Advice , 2018, Adventures Between Lower Bounds and Higher Altitudes.

[137]  Paola Bonizzoni,et al.  An External-Memory Algorithm for String Graph Construction , 2014, Algorithmica.

[138]  Klaus Ostermann,et al.  Parsing with first-class derivatives , 2016, OOPSLA.

[139]  Graham P. Oliver,et al.  Automatic Presentations for Finitely Generated Groups , 2005, STACS.

[140]  Bernard Boigelot,et al.  A Generalization of Cobham's Theorem to Automata over Real Numbers , 2007, ICALP.

[141]  Kazuyuki Amano,et al.  On XOR lemmas for the weight of polynomial threshold functions , 2019, Inf. Comput..

[142]  Hans-Jörg Kreowski,et al.  Fusion Grammars: A Novel Approach to the Generation of Graph Languages , 2017, ICGT.

[143]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[144]  Kai Salomaa,et al.  Branching Measures and Nearly Acyclic NFAs , 2017, DCFS.

[145]  J. Richard Büchi.  Regular canonical systems , 1964 .

[146]  Moshe Lewenstein,et al.  Parikh Matching in the Streaming Model , 2012, SPIRE.

[147]  Friedrich Otto,et al.  On the Connections between Rewriting and Formal Language Theory , 1999, RTA.

[148]  Thomas Place,et al.  The tale of the quantifier alternation hierarchy of first-order logic over words , 2015, SIGL.

[149]  Howard Straubing,et al.  Finite Semigroup Varieties Defined by Programs , 1997, Theor. Comput. Sci..

[150]  Stefanie Gerke,et al.  The asymptotic number of prefix normal words , 2019, Theor. Comput. Sci..

[151]  Jehoshua Bruck,et al.  Harmonic Analysis of Polynomial Threshold Functions , 1990, SIAM J. Discret. Math..

[152]  Frank Ruskey,et al.  On Combinatorial Generation of Prefix Normal Words , 2014, CPM.

[153]  Jean Berstel,et al.  Bifix codes and Sturmian words , 2010, ArXiv.

[154]  Antonio Restivo,et al.  An extension of the Burrows-Wheeler Transform , 2007, Theor. Comput. Sci..

[155]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[156]  C. R. Matthews.  Counting Points Modulo p for some Finitely Generated Subgroups of Algebraic Groups , 1982 .

[157]  Susanna Donatelli,et al.  Efficient model checking of the stochastic logic CSLTA , 2018, Perform. Evaluation.

[158]  Janusz A. Brzozowski,et al.  Derivatives of Regular Expressions , 1964, JACM.

[159]  Thomas Schwentick,et al.  Two-Variable Logic on Words with Data , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[160]  Marcel Paul Schützenberger,et al.  Sur une Variante des Fonctions Sequentielles , 1977, Theor. Comput. Sci..

[161]  Hugo Gimbert,et al.  Deciding the Value 1 Problem for Probabilistic Leaktight Automata , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[162]  Eric Allender,et al.  The Complexity of Complexity , 2017, Computability and Complexity.

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

[164]  P. Péladeau.  Classes de circuits booleens et varietes de monoides , 1990 .

[165]  Pascal Weil,et al.  Polynomial closure and unambiguous product , 1995, Theory of Computing Systems.

[166]  Tao Jiang,et al.  A Note on the Space Complexity of Some Decision Problems for Finite Automata , 1991, Inf. Process. Lett..

[167]  Kosaburo Hashiguchi,et al.  Improved Limitedness Theorems on Finite Automata with Distance Functions , 1990, Theor. Comput. Sci..

[168]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[169]  Matthew Might,et al.  On the complexity and performance of parsing with derivatives , 2016, PLDI.

[170]  Alexander A. Razborov,et al.  Majority gates vs. general weighted threshold gates , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[171]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[172]  Thomas Schwentick,et al.  Finite state machines for strings over infinite alphabets , 2004, TOCL.

[173]  M. Lothaire,et al.  Applied Combinatorics on Words , 2005 .

[174]  Bernd Becker,et al.  LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals , 2007, CAV.

[175]  Thomas Schwentick,et al.  On Notions of Regularity for Data Languages , 2007, FCT.

[176]  Antonio Restivo,et al.  Sorting Suffixes of a Text via its Lyndon Factorization , 2013, Stringology.

[177]  Ludovic Mignot,et al.  Geometrical Closure of Binary V_3/2 Languages , 2019, LATA.

[178]  Jacques Sakarovitch,et al.  Some operations and transductions that preserve rationality , 1983, Theoretical Computer Science.

[179]  David S. Wise.  A Strong Pumping Lemma for Context-Free Languages , 1976, Theor. Comput. Sci..

[180]  Anton Cerný,et al.  Counting subwords Using a Trie Automaton , 2011, Int. J. Found. Comput. Sci..

[181]  Luca Q. Zamboni,et al.  Abelian returns in Sturmian words , 2011, WORDS.

[182]  Zsuzsanna Lipták,et al.  On Infinite Prefix Normal Words , 2019, SOFSEM.

[183]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[184]  Tatsuya Akutsu.  A Linear Time Pattern Matching Algorithm Between a String and a Tree , 1993, CPM.

[186]  Oscar H. Ibarra,et al.  A Matrix q-Analogue of the Parikh Map , 2004, IFIP TCS.

[187]  Frank Stephan.  Automatic Structures — Recent Results and Open Questions , 2015 .

[188]  Kousha Etessami,et al.  First-Order Logic with Two Variables and Unary Temporal Logic , 2002, Inf. Comput..

[189]  Stasys Jukna,et al.  Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.

[190]  Henning Fernau,et al.  Problems on Finite Automata and the Exponential Time Hypothesis , 2016, CIAA.

[191]  Michael Tarsi,et al.  Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture , 1997, SIAM J. Comput..

[192]  Yiannis N. Moschovakis,et al.  Abstract Recursion and Intrinsic Complexity , 2018 .

[193]  Gilbert Baumslag,et al.  Parallel poly-pushdown groups , 1997 .

[194]  Howard Straubing,et al.  Actions, wreath products of C-varieties and concatenation product , 2006, Theor. Comput. Sci..

[195]  K. G. Subramanian,et al.  Product of Parikh Matrices and Commutativity , 2012, Int. J. Found. Comput. Sci..

[196]  Michael E. Saks,et al.  Minimizing Disjunctive Normal Form Formulas and AC0 Circuits Given a Truth Table , 2008, SIAM J. Comput..

[197]  Serge Grigorieff,et al.  Duality and Equational Theory of Regular Languages , 2008, ICALP.

[198]  Thomas N. Hibbard,et al.  A Generalization of Context-Free Determinism , 1967, Inf. Control..

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

[200]  CalvaneseDiego,et al.  Managing Change in Graph-Structured Data Using Description Logics , 2017 .

[201]  Stavros Konstantinidis,et al.  Error correction and decodability , 1996 .

[202]  Tomoyuki Yamakami.  One-Way Reversible and Quantum Finite Automata with Advice , 2012, LATA.

[203]  Achim Blumensath,et al.  Finite Presentations of Infinite Structures: Automata and Interpretations , 2004, Theory of Computing Systems.

[204]  Roman Glebov,et al.  On the Concentration of the Domination Number of the Random Graph , 2012, SIAM J. Discret. Math..

[205]  James Worrell,et al.  Effective Definability of the Reachability Relation in Timed Automata , 2019, Inf. Process. Lett..

[206]  Jürgen Dassow,et al.  Parikh Mapping and Iteration , 2000, WMP.

[207]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

[208]  S. Yu,et al.  A Pumping Lemma for Deterministic Context-Free Languages , 1989, Inf. Process. Lett..

[209]  Thomas Wilke,et al.  Classifying Discrete Temporal Properties , 1999, STACS.

[210]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[211]  Thomas Schwentick,et al.  Two-variable logic on data trees and XML reasoning , 2009, JACM.

[212]  Alexey Sorokin.  Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars , 2013, LFCS.

[213]  Zsuzsanna Lipták,et al.  Algorithms for Jumbled Pattern Matching in Strings , 2011, Int. J. Found. Comput. Sci..

[214]  Nathanaël Fijalkow,et al.  Undecidability results for probabilistic automata , 2017, SIGL.

[215]  J. Berstel,et al.  Context-free languages , 1993, SIGA.

[216]  Robert Knast,et al.  A Semigroup Characterization of Dot-Depth one Languages , 1983, RAIRO Theor. Informatics Appl..

[217]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[218]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[219]  J. Richard Büchi,et al.  Definability in the Existential Theory of Concatenation and Undecidable Extensions of this Theory , 1988, Math. Log. Q..

[220]  Hans-Jörg Kreowski,et al.  Relating DNA Computing and Splitting/Fusion Grammars , 2019, ICGT.

[221]  Moshe Lewenstein,et al.  Pattern Matching in Hypertext , 1997, J. Algorithms.

[222]  Christian Choffrut,et al.  Deciding whether the ordering is necessary in a Presburger formula , 2010, Discret. Math. Theor. Comput. Sci..

[223]  W. Wonham,et al.  The infimal prefix-closed and observable superlanguage of given language , 1991 .

[224]  Felix Klaedtke.  Bounds on the automata size for Presburger arithmetic , 2008, TOCL.

[225]  Markus Holzer.  On Emptiness and Counting for Alternating Finite Automata , 1995, Developments in Language Theory.

[226]  Kazuyuki Amano,et al.  On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function , 2020, LATA.

[227]  Hans-Jörg Kreowski,et al.  Transformation of Petri Nets into Context-Dependent Fusion Grammars , 2019, LATA.

[228]  N. Nisan.  The communication complexity of threshold gates , 1993 .

[229]  Susanna Donatelli,et al.  Autonomous Transitions Enhance CSLTA Expressiveness and Conciseness , 2019 .

[230]  Imre Simon,et al.  Piecewise testable events , 1975, Automata Theory and Formal Languages.

[231]  Jacques Sakarovitch,et al.  Squaring transducers: an efficient procedure for deciding functionality and sequentiality , 2000, Theor. Comput. Sci..

[232]  Richard J. Lipton,et al.  Polynomials that Sign Represent Parity and Descartes’ Rule of Signs , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[233]  Maxime Crochemore,et al.  Algorithms on strings , 2007 .

[234]  Dmitry Berdinsky,et al.  Towards quantitative classification of Cayley automatic groups , 2019, ArXiv.

[235]  Alan Cobham,et al.  Uniform tag sequences , 1972, Mathematical systems theory.

[236]  Thomas Place,et al.  Separating Regular Languages with Two Quantifiers Alternations , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[237]  Thomas Place,et al.  Separation and covering for group based concatenation hierarchies , 2019, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[238]  Volker Weispfenning,et al.  The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.

[239]  Makoto Kanazawa,et al.  MIX Is Not a Tree-Adjoining Language , 2012, ACL.

[240]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[241]  Wolfgang Thomas,et al.  Classifying Regular Events in Symbolic Logic , 1982, J. Comput. Syst. Sci..

[242]  Andreas Maletti,et al.  Survey: Tree Transducers in Machine Translation , 2010, NCMA.

[243]  Helmut Veith,et al.  On the automated verification of web applications with embedded SQL , 2016, ICDT.

[244]  Jeffrey Heinz,et al.  The computational nature of phonological generalizations , 2018 .

[245]  Antonio Restivo,et al.  On the Trace Product and some Families of Languages Closed under Partial Commutations , 2004, J. Autom. Lang. Comb..

[246]  Vojtech Rödl,et al.  Integer and Fractional Packings in Dense Graphs , 2001, Comb..

[247]  Giovanni Pighizzini,et al.  Limited Automata and Regular Languages , 2013, Int. J. Found. Comput. Sci..

[248]  Tomoyuki Yamakami.  The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata , 2010, Int. J. Found. Comput. Sci..

[249]  Pedro V. Silva,et al.  A topological approach to transductions , 2005, Theor. Comput. Sci..

[250]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1989, 30th Annual Symposium on Foundations of Computer Science.

[251]  L. Lipshitz.  The Diophantine problem for addition and divisibility , 1978 .

[252]  Mustapha Arfi.  Opérations polynomiales et hiérarchies de concaténation , 1991, Theor. Comput. Sci..

[253]  Burkhard Monien.  Two-Way Multihead Automata Over a One-Letter Alphabet , 1980, RAIRO Theor. Informatics Appl..

[254]  Anuj Dawar,et al.  Solving Linear Programs without Breaking Abstractions , 2015, J. ACM.

[255]  Ethan M. Coven,et al.  Sequences with minimal block growth , 2005, Mathematical systems theory.

[256]  A. Okhotin,et al.  Language equations , 2021, Handbook of Automata Theory.

[257]  Thomas Schwentick,et al.  Two-variable logic on data words , 2011, TOCL.

[258]  Olivier Carton,et al.  The Monadic Theory of Morphic Infinite Words and Generalizations , 2000, Inf. Comput..

[259]  Arto Salomaa,et al.  On an Extension of the Parikh Mapping , 2000 .

[260]  Daniel M. Kane,et al.  Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits , 2015, STOC.

[261]  Harold Fredricksen,et al.  Necklaces of beads in k colors and k-ary de Bruijn sequences , 1978, Discret. Math..

[262]  Hartmut Klauck,et al.  Communication Complexity Method for Measuring Nondeterminism in Finite Automata , 2002, Inf. Comput..

[263]  Nguyen Huong Lam,et al.  On Codes Having no Finite Completion , 1994, RAIRO Theor. Informatics Appl..

[264]  Jean-Marc Champarnaud,et al.  Decidability of Geometricity of Regular Languages , 2012, Developments in Language Theory.

[265]  Oscar H. Ibarra,et al.  A q-Analogue of the Parikh Matrix Mapping , 2007, Formal Models, Languages and Applications.

[266]  Andrej Muchnik.  The definable criterion for definability in Presburger arithmetic and its applications , 2003, Theor. Comput. Sci..

[267]  Peter Habermehl,et al.  Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree , 2012, STACS.

[268]  Georg Gottlob,et al.  Existential second-order logic over strings , 2000, JACM.

[269]  John Case,et al.  Automatic functions, linear time and learning , 2013, Log. Methods Comput. Sci..

[270]  R. Lyndon,et al.  Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series , 1958 .

[271]  Arthur Milchior,et al.  Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order , 2016, TAMC.

[272]  Tomoyuki Yamakami,et al.  Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages , 2013, SOFSEM.

[273]  Tomoyuki Yamakami.  Behavioral Strengths and Weaknesses of Various Models of Limited Automata , 2019, SOFSEM.

[274]  Pierre Wolper,et al.  Representing Arithmetic Constraints with Finite Automata: An Overview , 2002, ICLP.

[275]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[276]  Alon Orlitsky,et al.  Lower bounds on threshold and related circuits via communication complexity , 1994, IEEE Trans. Inf. Theory.

[277]  Hubert Comon-Lundh,et al.  Diophantine Equations, Presburger Arithmetic and Finite Automata , 1996, CAAP.

[278]  Detlef Wotschke,et al.  The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages , 1973, GI Jahrestagung.

[279]  Roberto Ierusalimschy,et al.  A parsing machine for PEGs , 2008, DLS '08.

[280]  Gwénaël Richomme,et al.  Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity , 2010, Int. J. Found. Comput. Sci..

[281]  Sanjay Jain,et al.  Semiautomatic Structures , 2017, Theory of Computing Systems.

[282]  Olivier Finkel.  Highly Undecidable Problems For Infinite Computations , 2009, RAIRO Theor. Informatics Appl..

[283]  Selim G. Akl,et al.  State Complexity of Finite Tree Width NFAs , 2012, J. Autom. Lang. Comb..

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

[285]  Grzegorz Rozenberg,et al.  The mathematical theory of L systems , 1980 .

[286]  Volker Weispfenning,et al.  Mixed real-integer linear quantifier elimination , 1999, ISSAC '99.

[287]  Markus Dickinson,et al.  Computational approaches to morphology and syntax (review) , 2010 .

[288]  James Rogers,et al.  A descriptive approach to language-theoretic complexity , 1998 .

[289]  Luca Q. Zamboni,et al.  Balance and Abelian complexity of the Tribonacci word , 2009, Adv. Appl. Math..

[290]  Andrzej Ehrenfeucht,et al.  On regularity of languages generated by copying systems , 1984, Discret. Appl. Math..

[291]  Martin Grohe,et al.  Lovász Meets Weisfeiler and Leman , 2018, ICALP.

[292]  Udi Manber,et al.  APPROXIMATE STRING MATCHING WITH ARBITRARY COSTS FOR TEXT AND HYPERTEXT , 1993 .

[293]  Matthias Kuntz,et al.  GCSRL - A Logic for Stochastic Reward Models with Timed and Untimed Behaviour , 2007 .

[294]  Gwénaël Richomme,et al.  Abelian complexity of minimal subshifts , 2009, J. Lond. Math. Soc..

[295]  Jeffrey Heinz,et al.  Vowel Harmony and Subsequentiality , 2013, MOL.

[296]  Hanspeter Bieri,et al.  Elementary Set Operations with d-Dimensional Polyhedra , 1988, Workshop on Computational Geometry.

[297]  Denis Thérien,et al.  An Algebraic Point of View on the Crane Beach Property , 2006, CSL.

[298]  Jürgen Forster,et al.  A linear lower bound on the unbounded error probabilistic communication complexity , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[299]  Arkadev Chattopadhyay,et al.  A Short List of Equalities Induces Large Sign Rank , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[300]  André Nies,et al.  Finite automata presentable abelian groups , 2007, Ann. Pure Appl. Log..

[301]  Traian-Florin Serbanuta.  Extending Parikh matrices , 2004, Theor. Comput. Sci..

[302]  Jorge E. Mezei,et al.  On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..

[303]  Thomas Place,et al.  The Covering Problem , 2017, Log. Methods Comput. Sci..

[304]  Howard Straubing,et al.  FINITE SEMIGROUP VARIETIES OF THE FORM V,D , 1985 .

[305]  E. Scheinerman,et al.  Fractional Graph Theory: A Rational Approach to the Theory of Graphs , 1997 .

[306]  Satyanarayana V. Lokam,et al.  Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity , 2001, FSTTCS.

[307]  Chirag Jain,et al.  On the Complexity of Sequence to Graph Alignment , 2019, bioRxiv.

[308]  Tomoyuki Yamakami.  Swapping Lemmas for Regular and Context-Free Languages with Advice , 2008, ArXiv.

[309]  Peter Leupold,et al.  Languages generated by iterated idempotency , 2007, Theor. Comput. Sci..

[310]  Sheng Yu,et al.  Constructions for alternating finite automata , 1990, Int. J. Comput. Math..

[311]  Tero Harju,et al.  Combinatorics on Words , 2004 .

[312]  Jeffrey Heinz,et al.  Strict Locality and Phonological Maps , 2018, Linguistic Inquiry.

[313]  Viliam Geffert,et al.  An alternating hierarchy for finite automata , 2012, Theor. Comput. Sci..

[314]  Adrian Atanasiu.  Parikh Matrix Mapping and Amiability Over a Ternary Alphabet , 2014, Discrete Mathematics and Computer Science.

[315]  Thomas Wilke,et al.  Over words, two variables are as powerful as one quantifier alternation , 1998, STOC '98.

[316]  Thomas Place,et al.  Separating Regular Languages by Piecewise Testable and Unambiguous Languages , 2013, MFCS.

[317]  Alan Cobham,et al.  On the base-dependence of sets of numbers recognizable by finite automata , 1969, Mathematical systems theory.

[318]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[319]  Carlos Martín-Vide,et al.  On the Injectivity of the Parikh Matrix Mapping , 2002, Fundam. Informaticae.

[320]  David Haussler,et al.  Building a Pan-Genome Reference for a Population , 2015, J. Comput. Biol..

[321]  Peter Habermehl,et al.  On the Use of Non-deterministic Automata for Presburger Arithmetic , 2010, CONCUR.

[322]  Kosaburo Hashiguchi,et al.  Algorithms for Determining Relative Star height and Star Height , 1988, IFIP Congress.

[323]  Jarkko Kari,et al.  Computational fractal geometry with WFA , 1997, Acta Informatica.

[324]  M. Nivat,et al.  Relations rationnelles infinitaires , 1984 .

[325]  Jean-Éric Pin,et al.  The Dot-Depth Hierarchy, 45 Years Later , 2017, The Role of Theory in Computer Science.

[326]  Seymour Ginsburg,et al.  Deterministic Context Free Languages , 1965, Inf. Control..

[327]  Yoshihide Igarashi.  A Pumping Lemma for Real-Time Deterministic Context-Free Languages , 1985, Theor. Comput. Sci..

[328]  Frank Ruskey,et al.  Normal, Abby Normal, Prefix Normal , 2014, FUN.

[329]  Jorma Tarhio,et al.  Alternative Algorithms for Lyndon Factorization , 2014, Stringology.

[330]  Faith Ellen,et al.  Languages of R-Trivial Monoids , 1980, J. Comput. Syst. Sci..

[331]  Galina Jirásková.  The Ranges of State Complexities for Complement, Star, and Reversal of Regular Languages , 2014, Int. J. Found. Comput. Sci..

[332]  Jean-Eric Pin,et al.  Topologies for the free monoid , 1991 .

[333]  The Computational Pan-Genomics Consortium,et al.  Computational pan-genomics: status, promises and challenges , 2018, Briefings Bioinform..

[334]  Patricia Bouyer,et al.  An algebraic approach to data languages and timed languages , 2003, Inf. Comput..

[335]  Maxime Crochemore,et al.  A note on the Burrows-Wheeler transformation , 2005, ArXiv.

[336]  Maxime Crochemore,et al.  Fast parallel Lyndon factorization with applications , 1995, Mathematical systems theory.

[337]  Manfred Kufleitner.  On Bijective Variants of the Burrows-Wheeler Transform , 2009, Stringology.

[338]  Arto Salomaa.  Connections between subwords and certain matrix mappings , 2005, Theor. Comput. Sci..

[339]  Saburo Muroga,et al.  Threshold logic and its applications , 1971 .

[340]  Emmanuel Filiot,et al.  Logic-Automata Connections for Transformations , 2015, ICLA.

[341]  Jérôme Leroux,et al.  A polynomial time Presburger criterion and synthesis for number decision diagrams , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[342]  Thomas Schwentick,et al.  Two-variable logic and key constraints on data words , 2011, ICDT '11.

[343]  Denis Thérien,et al.  Computational complexity questions related to finite monoids and semigroups , 2003 .

[344]  Ludwig Staiger,et al.  Finite Automata Encoding Geometric Figures , 1999, WIA.

[345]  David Haussler,et al.  On Regularity of Context-Free Languages , 1983, Theor. Comput. Sci..

[346]  Janusz A. Brzozowski,et al.  The Dot-Depth Hierarchy of Star-Free Languages is Infinite , 1978, J. Comput. Syst. Sci..

[347]  Makoto Kanazawa.  The Pumping Lemma for Well-Nested Multiple Context-Free Languages , 2009, Developments in Language Theory.

[348]  Martin Fürer,et al.  On the power of combinatorial and spectral invariants , 2010 .

[349]  James Worrell,et al.  When is Containment Decidable for Probabilistic Automata? , 2018, ICALP.

[350]  André Nies,et al.  Automatic structures: richness and limitations , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[351]  Kristian Kersting,et al.  Dimension Reduction via Colour Refinement , 2013, ESA.

[352]  Gideon Ehrlich,et al.  Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations , 1973, JACM.

[353]  Shuji Jimbo,et al.  Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata , 2002, Int. J. Algebra Comput..

[354]  Juhani Karhumäki.  Generalized Parikh Mappings and Homomorphisms , 1980, Inf. Control..

[355]  Peter Leupold,et al.  On Regularity-Preservation by String-Rewriting Systems , 2008, LATA.

[356]  A. Nies,et al.  FA-presentable groups and rings , 2008 .

[357]  Anca Muscholl,et al.  Permutation rewriting and algorithmic verification , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[358]  Bernard Boigelot,et al.  A Generalization of Semenov's Theorem to Automata over Real Numbers , 2009, CADE.

[359]  Antonio Restivo,et al.  Suffix array and Lyndon factorization of a text , 2014, J. Discrete Algorithms.

[360]  Luc Segoufin.  Automata and Logics for Words and Trees over an Infinite Alphabet , 2006, CSL.

[361]  Arto Salomaa,et al.  Subword histories and Parikh matrices , 2004, J. Comput. Syst. Sci..

[362]  Costas S. Iliopoulos,et al.  Parallel RAM Algorithms for Factorizing Words , 1994, Theor. Comput. Sci..

[363]  Eric Allender,et al.  Power from random strings , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[364]  Martin Otto,et al.  Two variable first-order logic over ordered domains , 2001, Journal of Symbolic Logic.

[365]  Fritz Henglein,et al.  PEG parsing in less space using progressive tabling and dynamic analysis , 2017, PEPM.

[366]  Ugur Küçük,et al.  Finite Automata with Advice Tapes , 2014, Int. J. Found. Comput. Sci..

[367]  Denis Thérien,et al.  The Computing Power of Programs over Finite Monoids , 2002, J. Autom. Lang. Comb..

[368]  Jeffrey Jaffe,et al.  A necessary and sufficient pumping lemma for regular languages , 1978, SIGA.

[369]  Alexey Sorokin.  Ogden Property for Linear Displacement Context-Free Grammars , 2016, LFCS.

[370]  G. Rozenberg,et al.  Pumping Lemmas for Regular Sets , 1981, SIAM J. Comput..

[371]  Howard Straubing,et al.  When Can One Finite Monoid Simulate Another , 2000 .

[372]  David G. Kirkpatrick,et al.  On the Complexity of General Graph Factor Problems , 1981, SIAM J. Comput..

[373]  Thomas Schwentick,et al.  Second-Order Logic over Strings: Regular and Non-regular Fragments , 2001, Developments in Language Theory.

[374]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

[375]  Hing Leung.  Descriptional complexity of nfa of different ambiguity , 2005, Int. J. Found. Comput. Sci..

[376]  Ryo Yoshinaka,et al.  Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages , 2010, LATA.

[377]  A. L. Semenov,et al.  Presburgerness of predicates regular in two number systems , 1977 .

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

[379]  Thomas Graf,et al.  Closure Properties of Minimalist Derivation Tree Languages , 2011, LACL.

[380]  J. H. Kima.  Sandwiching random graphs : universality between random graph models , 2002 .

[381]  S. M. Gersten,et al.  THE OPTIMAL ISOPERIMETRIC INEQUALITY FOR TORUS BUNDLES OVER THE CIRCLE , 1996 .

[382]  Murray Elder,et al.  Separating automatic from Cayley automatic groups , 2020 .

[383]  Ahmet Kara.  Logics on data words , 2016 .

[384]  Alexander Okhotin,et al.  State complexity of cyclic shift , 2008, RAIRO Theor. Informatics Appl..

[385]  Christophe Prieur.  How to decide continuity of rational functions on infinite words , 2002, Theor. Comput. Sci..

[386]  Galina Jirásková,et al.  Operations on Boolean and Alternating Finite Automata , 2018, CSR.

[387]  Martin Otto,et al.  Bounded Variable Logics and Counting: A Study in Finite Models , 1997, Lecture Notes in Logic.

[388]  Stephen Alstrup,et al.  Pattern matching in dynamic texts , 2000, SODA '00.

[389]  Pierre Wolper,et al.  On the Construction of Automata from Linear Arithmetic Constraints , 2000, TACAS.

[390]  Gregory M. Kobele,et al.  Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages , 2011, LACL.

[391]  László Babai,et al.  Graph isomorphism in quasipolynomial time [extended abstract] , 2015, STOC.

[392]  Yechezkel Zalcstein,et al.  Locally Testable Languages , 1972, J. Comput. Syst. Sci..

[393]  J. Conway.  Regular algebra and finite machines , 1971 .

[394]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[395]  Stefano Varricchio,et al.  On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems , 1992, Inf. Process. Lett..

[396]  Makoto Kanazawa.  Ogden's Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy , 2016, LATA.

[397]  Jean Néraud,et al.  Embedding a θ-invariant code into a complete one , 2020, Theor. Comput. Sci..

[398]  Bryan Ford,et al.  Parsing expression grammars: a recognition-based syntactic foundation , 2004, POPL '04.

[399]  Denis Thérien,et al.  DIAMONDS ARE FOREVER: THE VARIETY DA , 2002 .

[400]  Paul Gastin,et al.  Weighted automata and weighted logics , 2005, Theor. Comput. Sci..

[401]  Rémi Eyraud,et al.  Learning Strictly Local Subsequential Functions , 2014, TACL.

[402]  Anthony Widjaja To.  Unary finite automata vs. arithmetic progressions , 2008 .

[403]  Robert K. Brayton,et al.  Model-checking continuous-time Markov chains , 2000, TOCL.

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

[405]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[406]  Eric Allender,et al.  New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems , 2019, MFCS.

[407]  Narad Rampersad,et al.  Recurrent words with constant Abelian complexity , 2009, Adv. Appl. Math..

[408]  B. Scarpellini.  Complexity of subcases of Presburger arithmetic , 1984 .

[409]  Jane Chandlee,et al.  STRICTLY LOCAL PHONOLOGICAL PROCESSES , 2014 .

[410]  Virgil Nicolae Serbanuta.  On Parikh Matrices, Ambiguity, and PRINTS , 2009, Int. J. Found. Comput. Sci..

[411]  Ondrej Klíma.  Piecewise testable languages via combinatorics on words , 2011, Discret. Math..

[412]  Detlef Wotschke,et al.  Nondeterminism and Boolean Operations in PDAs , 1978, J. Comput. Syst. Sci..

[413]  Aldo de Luca,et al.  Finiteness and Regularity in Semigroups and Formal Languages , 1999, Monographs in Theoretical Computer Science An EATCS Series.

[414]  Jane Chandlee,et al.  Autosegmental Input Strictly Local Functions , 2019, Transactions of the Association for Computational Linguistics.

[415]  Jérôme Leroux,et al.  TaPAS: The Talence Presburger Arithmetic Suite , 2009, TACAS.

[416]  Jean-Eric Pin,et al.  A variety theorem without complementation , 1995 .

[417]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

[418]  Akira Maruoka,et al.  On the Complexity of Depth-2 Circuits with Threshold Gates , 2005, MFCS.

[419]  Alberto Bertoni,et al.  Quantum Computing: 1-Way Quantum Automata , 2003, Developments in Language Theory.

[420]  Ohad Shamir,et al.  Depth Separations in Neural Networks: What is Actually Being Separated? , 2019, Constructive Approximation.

[421]  Leonard M. Adleman,et al.  NP-Complete Decision Problems for Binary Quadratics , 1978, J. Comput. Syst. Sci..

[422]  Howard Straubing.  Languages Defined with Modular Counting Quantifiers , 2001, Inf. Comput..

[423]  Peter M. Higgins.  A Proof on Simon's Theorem on Piecewise Testable Languages , 1997, Theor. Comput. Sci..

[424]  Thomas Schwentick,et al.  Two-Variable Logic with Two Order Relations - (Extended Abstract) , 2010, CSL.

[425]  Oleg Verbitsky,et al.  On the Weisfeiler-Leman Dimension of Fractional Packing , 2019, LATA.

[426]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[427]  David J. Weir,et al.  Characterizing Structural Descriptions Produced by Various Grammatical Formalisms , 1987, ACL.

[428]  Joost Engelfriet,et al.  MSO definable string transductions and two-way finite-state transducers , 1999, TOCL.

[429]  Kosaburo Hashiguchi,et al.  Limitedness Theorem on Finite Automata with Distance Functions , 1982, J. Comput. Syst. Sci..

[430]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[431]  Janusz A. Brzozowski,et al.  Dot-Depth of Star-Free Events , 1971, Journal of computer and system sciences (Print).

[432]  Frank Ruskey,et al.  On Prefix Normal Words and Prefix Normal Forms , 2016, Theor. Comput. Sci..

[433]  Pierre McKenzie,et al.  The Power of Programs over Monoids in DA , 2017, MFCS.

[434]  Ian Pratt-Hartmann,et al.  Logics with counting and equivalence , 2014, CSL-LICS.

[435]  Tomoyuki Yamakami,et al.  Immunity and pseudorandomness of context-free languages , 2009, Theor. Comput. Sci..

[436]  Anne Condon,et al.  The Complexity of Space Boundes Interactive Proof Systems , 1993, Complexity Theory: Current Research.

[437]  Jean Pierre Duval,et al.  Factorizing Words over an Ordered Alphabet , 1983, J. Algorithms.

[438]  Aravind K. Joshi,et al.  Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..

[439]  Sasha Rubin,et al.  Automata Presenting Structures: A Survey of the Finite String Case , 2008, Bulletin of Symbolic Logic.

[440]  Hideo Bannai,et al.  On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations , 2019, CPM.

[441]  Juris Hartmanis.  Computational Complexity of One-Tape Turing Machine Computations , 1968, JACM.

[442]  Rémi Eyraud,et al.  Output Strictly Local Functions , 2015, MOL.

[443]  Howard Straubing,et al.  Partially ordered finite monoids and a theorem of I , 1988 .

[444]  Pierre Guillon,et al.  Comparison of max-plus automata and joint spectral radius of tropical matrices , 2016, MFCS.

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

[446]  Ryo Yoshinaka,et al.  An Algebraic Approach to Multiple Context-Free Grammars , 2014, LACL.

[447]  Arend Rensink,et al.  Canonical Graph Shapes , 2004, ESOP.

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

[449]  Simone Severini,et al.  Pebble Games and Cospectral Graphs , 2017, Electron. Notes Discret. Math..

[450]  Moshe Lewenstein,et al.  Clustered Integer 3SUM via Additive Combinatorics , 2015, STOC.

[451]  Jorge Almeida,et al.  Implicit operations on finite J-trivial semigroups and a conjecture of I. Simon , 1991 .

[452]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[453]  David Darais,et al.  Parsing with derivatives: a functional pearl , 2011, ICFP.

[454]  Martin Kutrib,et al.  The Boolean Closure of Linear Context-Free Languages , 2004, Developments in Language Theory.

[455]  Paola Bonizzoni,et al.  Inverse Lyndon words and Inverse Lyndon factorizations of words , 2017, Adv. Appl. Math..

[456]  Alexander Meduna,et al.  Jumping Finite Automata , 2012, Int. J. Found. Comput. Sci..

[457]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[458]  Zsuzsanna Lipták,et al.  Bubble-Flip - A New Generation Algorithm for Prefix Normal Words , 2018, Theor. Comput. Sci..

[459]  Paola Bonizzoni,et al.  FSG: Fast String Graph Construction for De Novo Assembly , 2016, J. Comput. Biol..

[460]  Thomas Graf,et al.  Curbing Feature Coding: Strictly Local Feature Assignment , 2020, SCIL.

[461]  M. Bridson,et al.  Formal language theory and the geometry of 3-manifolds , 1996 .

[462]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[463]  Ryo Yoshinaka,et al.  The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages , 2014, Theory of Computing Systems.

[464]  K. N. King,et al.  Alternating Multihead Finite Automata (Extended Abstract) , 1981, ICALP.

[465]  Pierre-Alain Reynier,et al.  Transducers, logic and algebra for functions of finite words , 2016, SIGL.

[466]  Carlos Martín-Vide,et al.  Codifiable Languages and the Parikh Matrix Mapping , 2001, J. Univers. Comput. Sci..

[467]  Eugene W. Myers,et al.  The fragment assembly string graph , 2005, ECCB/JBI.

[468]  Alain Finkel,et al.  Decomposition of Decidable First-Order Logics over Integers and Reals , 2008, 2008 15th International Symposium on Temporal Representation and Reasoning.

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

[470]  Juraj Hromkovic.  On the Power of Alternation in Automata Theory , 1985, J. Comput. Syst. Sci..

[471]  Nissim Francez,et al.  Finite-Memory Automata , 1994, Theor. Comput. Sci..

[472]  Howard Straubing,et al.  Small varieties of finite semigroups and extensions , 1984 .

[473]  Eric Allender,et al.  Zero knowledge and circuit minimization , 2014, Inf. Comput..

[474]  Kohtaro Tadaki,et al.  Theory of One Tape Linear Time Turing Machines , 2003, SOFSEM.

[475]  Thomas Schwentick,et al.  The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey , 2010, Fields of Logic and Computation.

[476]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[477]  Etsuro Moriya,et al.  A Grammatical Characterization of Alternating Pushdown Automata , 1989, Theor. Comput. Sci..

[478]  Alexander Okhotin.  Unambiguous Finite Automata over a Unary Alphabet , 2010, MFCS.

[479]  Florin Manea,et al.  k-Abelian pattern matching , 2014, J. Discrete Algorithms.

[480]  Orna Grumberg,et al.  Variable Automata over Infinite Alphabets , 2010, LATA.

[481]  Free Lie algebras,et al.  Free Lie algebras , 2015 .

[482]  Christel Baier,et al.  Model Checking Markov Chains with Actions and State Labels , 2007, IEEE Transactions on Software Engineering.

[483]  Thomas Zeume,et al.  Two-Variable Logic on 2-Dimensional Structures , 2013, CSL.

[484]  Jeanne Ferrante,et al.  A Decision Procedure for the First Order Theory of Real Addition with Order , 1975, SIAM J. Comput..

[485]  Christopher L. Miller.  Expansions of Dense Linear Orders with The Intermediate Value Property , 2001, J. Symb. Log..

[486]  William H. Sanders,et al.  Stochastic Activity Networks: Structure, Behavior, and Application , 1985, PNPM.

[487]  Michal Kunc.  The Power of Commuting with Finite Sets of Words , 2006, Theory of Computing Systems.

[488]  Françoise Gire.  Two Decidability Problems for Infinite Words , 1986, Inf. Process. Lett..

[489]  Eric Allender,et al.  Minimum Circuit Size, Graph Isomorphism, and Related Problems , 2017, Electron. Colloquium Comput. Complex..

[490]  Alexander Okhotin,et al.  Conjunctive and Boolean grammars: The true general case of the context-free grammars , 2013, Comput. Sci. Rev..

[491]  Christel Baier,et al.  On the Logical Characterisation of Performability Properties , 2000, ICALP.