default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLATA 2020, Milan, Italy
- Alberto Leporati
, Carlos Martín-Vide, Dana Shapira, Claudio Zandron:
Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings. Lecture Notes in Computer Science 12038, Springer 2020, ISBN 978-3-030-40607-3
Invited Papers
- Eric Allender:
The New Complexity Landscape Around Circuit Minimization. 3-16 - Laure Daviaud:
Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases. 17-32 - Christoph Haase:
Approaching Arithmetic Theories with Finite-State Automata. 33-43 - Artur Jez:
Recompression: Technique for Word Equations and Compressed Data. 44-67 - Jean-Éric Pin:
How to Prove that a Language Is Regular or Star-Free? 68-88 - Thomas Place:
Deciding Classes of Regular Languages: The Covering Approach. 89-112
Algebraic Structures
- Dmitry Berdinsky, Prohrak Kruengthomya:
Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the Circle. 115-127 - Alexis Bès, Christian Choffrut:
$\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $. 128-140 - Ziyuan Gao, Sanjay Jain, Ji Qi, Philipp Schlicht, Frank Stephan, Jacob Tarr:
Ordered Semiautomatic Rings with Applications to Geometry. 141-153
Automata
- Siddharth Bhaskar, Jane Chandlee, Adam Jardine, Christopher Oakden:
Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions. 157-169 - Susanna Donatelli, Serge Haddad:
Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models. 170-183 - Mehmet Utkan Gezer:
Windable Heads and Recognizing NL with Constant Randomness. 184-195 - Chris Keeler, Kai Salomaa:
Alternating Finite Automata with Limited Universal Branching. 196-207 - Nadia Labai, Tomer Kotek, Magdalena Ortiz, Helmut Veith:
Pebble-Intervals Automata and FO2 with Two Orders. 208-221 - Ahmet Bilal Uçan:
Limited Two-Way Deterministic Finite Automata with Advice. 222-232
Complexity
- Kazuyuki Amano:
On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function. 235-247 - Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Complexity Issues of String to Graph Approximate Matching. 248-259 - Hans Zantema:
Complexity of Automatic Sequences. 260-271
Grammars
- Aaron Lye:
Context-Sensitive Fusion Grammars Are Universal. 275-286 - Alexander Okhotin, Alexey Sorokin:
Cyclic Shift on Multi-component Grammars. 287-299
Languages
- Olivier Finkel:
The Automatic Baire Property and an Effective Property of ømega-Rational Functions. 303-314 - Nathan Grosshans:
The Power of Programs over Monoids in [inline-graphic not available: see fulltext]. 315-327 - Ondrej Klíma, Peter Kostolányi:
Geometrically Closed Positive Varieties of Star-Free Languages. 328-340 - Tomoyuki Yamakami:
Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas. 341-353
Trees and Graphs
- Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
On the Weisfeiler-Leman Dimension of Fractional Packing. 357-368 - Jing Ji, Jeffrey Heinz:
Input Strictly Local Tree Transducers. 369-381
Words and Codes
- Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words. 385-396 - Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach:
Reducing the Ambiguity of Parikh Matrices. 397-411 - Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka, Danny Bøgsted Poulsen:
On Collapsing Prefix Normal Words. 412-424 - Aaron Moss:
Simplified Parsing Expression Derivatives. 425-436 - Jean Néraud:
Complete Variable-Length Codes: An Excursion into Word Edit Operations. 437-448
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-02-15 00:23 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:
