default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLATA 2021, Milan, Italy
- Alberto Leporati
, Carlos Martín-Vide, Dana Shapira, Claudio Zandron:
Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, Proceedings. Lecture Notes in Computer Science 12638, Springer 2021, ISBN 978-3-030-68194-4
Algebraic Structures
- Fabian Birkmann, Stefan Milius, Henning Urbat:
On Language Varieties Without Boolean Operations. 3-15 - Valentina Dorigatti, Paolo Massazza:
Partially Directed Animals with a Bounded Number of Holes. 16-28 - Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan:
On the Computational Power of Programs over BA2 Monoid. 29-40
Automata
- Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Location Based Automata for Expressions with Shuffle. 43-54 - Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Representations for (Non)Deterministic Finite Automata. 55-67 - Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
Optimising Attractor Computation in Boolean Automata Networks. 68-80 - Semyon Petrov, Alexander Okhotin:
On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata. 81-93
Complexity
- Aaron Lye:
Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete. 97-108 - Hiroki Morizumi:
On the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits. 109-117 - Mikhail Mrykhin, Alexander Okhotin:
On Hardest Languages for One-Dimensional Cellular Automata. 118-130 - Giovanni Pighizzini, Branislav Rovan, Simon Sádovský:
Usefulness of Information and Unary Languages. 131-142
Learning
- David R. Bélanger, Ziyuan Gao, Sanjay Jain, Wei Li, Frank Stephan:
Learnability and Positive Equivalence Relations. 145-156 - Frits W. Vaandrager, Roderick Bloem, Masoud Ebrahimi:
Learning Mealy Machines with One Timer. 157-170
Logics and Languages
- Borzoo Bonakdarpour, Sarai Sheinvald:
Finite-Word Hyperlanguages. 173-186 - Jens Oliver Gutsfeld, Markus Müller-Olm, Christian Dielitz:
Temporal Logics with Language Parameters. 187-199 - Mamoru Ishizuka, Takahito Aoto, Munehiro Iwami:
Commutative Rational Term Rewriting. 200-212 - Takayuki Miyazaki, Yasuhiko Minamide:
Context-Free Grammars with Lookahead. 213-225 - K. Subramani, Piotr Wojciechowski:
Tree-Like Unit Refutations in Horn Constraint Systems. 226-237
Trees and Graphs
- Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding. 241-254 - Frederic Dörband, Thomas Feller, Kevin Stier:
Approximated Determinisation of Weighted Tree Automata. 255-266 - Frederic Dörband, Thomas Feller, Kevin Stier:
Sequentiality of Group-Weighted Tree Automata. 267-278 - Bastien Sérée, Loïg Jezequel, Didier Lime:
An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs. 279-290
Words and Strings
- Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová:
On Balanced Sequences and Their Asymptotic Critical Exponent. 293-304 - Stefan Hoffmann:
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words. 305-317 - Stefan Hoffmann:
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets. 318-330 - Julian Pape-Lange:
Cadences in Grammar-Compressed Strings. 331-342
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-20 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
