default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th LATA 2018: Ramat Gan, Israel
- Shmuel Tomi Klein, Carlos Martín-Vide, Dana Shapira:
Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings. Lecture Notes in Computer Science 10792, Springer 2018, ISBN 978-3-319-77312-4 - Andrei A. Bulatov:
Constraint Satisfaction Problems: Complexity and Algorithms. 1-25 - Moses Ganardi, Danny Hucke, Markus Lohrey:
Sliding Window Algorithms for Regular Languages. 26-35 - Alexander Okhotin
:
Underlying Principles and Recurring Ideas of Formal Grammars. 36-59 - Eli Shamir:
Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects. 60-67 - Ekaterina Bakinova, Artem Basharin, Igor Batmanov, Konstantin Lyubort, Alexander Okhotin, Elizaveta Sazhneva:
Formal Languages over GF(2). 68-79 - Laura Bozzelli, Aniello Murano, Adriano Peron:
Event-Clock Nested Automata. 80-92 - J. Andres Montoya, Christian Nolasco:
On the Synchronization of Planar Automata. 93-104 - Maris Valdats:
Descriptional and Computational Complexity of the Circuit Representation of Finite Automata. 105-117 - Alexey N. Zhirabok, Alexey Ye. Shumsky:
Disturbance Decoupling in Finite Automata. 118-129 - Johannes Klaus Fichte, Markus Hecher, Irina Schindler:
Default Logic and Bounded Treewidth. 130-142 - Stefan Gerdjikov:
A General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers. 143-155 - Demen Güler, Andreas Krebs, Klaus-Jörn Lange, Petra Wolf:
Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy. 156-168 - Sanjay Jain, Shao Ning Kuek, Eric Martin, Frank Stephan:
Learners Based on Transducers. 169-181 - Rick Smetsers, Paul Fiterau-Brostean, Frits W. Vaandrager:
Model Learning as a Satisfiability Modulo Theories Problem. 182-194 - Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger:
Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects. 195-206 - Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
Bubble-Flip - A New Generation Algorithm for Prefix Normal Words. 207-219 - Murray Elder, Yoong Kuan Goh:
Permutations Sorted by a Finite and an Infinite Stack in Series. 220-231 - Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On Periodicity Lemma for Partial Words. 232-244 - Dmitry Berdinsky, Phongpitak Trakuldit:
Measuring Closeness Between Cayley Automatic Groups and Automatic Groups. 245-257 - Thomas Chatain, Maurice Comlan, David Delfieu, Loïg Jezequel, Olivier H. Roux:
Pomsets and Unfolding of Reset Petri Nets. 258-270 - Mathias Ruggaard Pedersen, Nathanaël Fijalkow, Giorgio Bacci, Kim G. Larsen, Radu Mardare:
Timed Comparisons of Semi-Markov Processes. 271-283 - Markus Saers, Dekai Wu:
Handling Ties Correctly and Efficiently in Viterbi Training Using the Viterbi Semiring. 284-295 - Uli Schlachter:
Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets. 296-307 - Christoph Teichmann, Antoine Venant, Alexander Koller:
Efficient Translation with Linear Bimorphisms. 308-320
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-26 20:51 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:
