LATA

Keyphrases

Publications

2021

Stefan Hoffmann
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words. LATA (2021)
K. Subramani, Piotr J. Wojciechowski
Tree-Like Unit Refutations in Horn Constraint Systems. LATA (2021)
David R. Bélanger, Ziyuan Gao, Sanjay Jain, Wei Li, Frank Stephan
Learnability and Positive Equivalence Relations. LATA (2021)
Frederic Dörband, Thomas Feller, Kevin Stier
Sequentiality of Group-Weighted Tree Automata. LATA (2021)
Borzoo Bonakdarpour, Sarai Sheinvald
Finite-Word Hyperlanguages. LATA (2021)
Stefan Hoffmann
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets. LATA (2021)
Jens Oliver Gutsfeld, Markus Müller-Olm, Christian Dielitz
Temporal Logics with Language Parameters. LATA (2021)
Mamoru Ishizuka, Takahito Aoto, Munehiro Iwami
Commutative Rational Term Rewriting. LATA (2021)
Semyon Petrov, Alexander Okhotin
On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata. LATA (2021)
Valentina Dorigatti, Paolo Massazza
Partially Directed Animals with a Bounded Number of Holes. LATA (2021)
Frederic Dörband, Thomas Feller, Kevin Stier
Approximated Determinisation of Weighted Tree Automata. LATA (2021)
Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan
Monoid. LATA (2021)
Bastien Sérée, Loïg Jezequel, Didier Lime
An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs. LATA (2021)
Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová
On Balanced Sequences and Their Asymptotic Critical Exponent. LATA (2021)
Mikhail Mrykhin, Alexander Okhotin
On Hardest Languages for One-Dimensional Cellular Automata. LATA (2021)
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
Optimising Attractor Computation in Boolean Automata Networks. LATA (2021)
Giovanni Pighizzini, Branislav Rovan, Simon Sádovský
Usefulness of Information and Unary Languages. LATA (2021)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding. LATA (2021)
Frits W. Vaandrager, Roderick Bloem, Masoud Ebrahimi
Learning Mealy Machines with One Timer. LATA (2021)
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
Location Based Automata for Expressions with Shuffle. LATA (2021)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Representations for (Non)Deterministic Finite Automata. LATA (2021)
Aaron Lye
Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete. LATA (2021)
Julian Pape-Lange
Cadences in Grammar-Compressed Strings. LATA (2021)
Fabian Birkmann, Stefan Milius, Henning Urbat
On Language Varieties Without Boolean Operations. LATA (2021)
Takayuki Miyazaki, Yasuhiko Minamide
Context-Free Grammars with Lookahead. LATA (2021)
Hiroki Morizumi
On the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits. LATA (2021)

volume 12638, 2021

Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, Proceedings LATA 12638 (2021)

2020

volume 12038, 2020

Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings LATA 12038 (2020)