default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st DLT 2017: Liège, Belgium
- Émilie Charlier, Julien Leroy, Michel Rigo
:
Developments in Language Theory - 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings. Lecture Notes in Computer Science 10396, Springer 2017, ISBN 978-3-319-62808-0
Invited Talks
- Véronique Bruyère:
Computer Aided Synthesis: A Game-Theoretic Approach. 3-35 - Sergey Kitaev:
A Comprehensive Introduction to the Theory of Word-Representable Graphs. 36-67 - Eric Rowland:
Binomial Coefficients, Valuations, and Words. 68-74 - Michal Skrzypczak:
Connecting Decidability and Complexity for MSO Logic. 75-79
Regular Papers
- Simon Beier, Markus Holzer:
On Regular Expression Proof Complexity. 83-95 - Simon Beier, Markus Holzer, Martin Kutrib:
Operational State Complexity and Decidability of Jumping Finite Automata. 96-108 - Vincent Hugot, Adrien Boiret, Joachim Niehren:
Equivalence of Symbolic Tree Transducers. 109-121 - Michiel de Bondt, Henk Don, Hans Zantema:
DFAs and PFAs with Long Shortest Synchronizing Word Length. 122-133 - Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis:
On the Mother of All Automata: The Position Automaton. 134-146 - Olivier Carton, Léo Exibard, Olivier Serre:
Two-Way Two-Tape Automata. 147-159 - Jörg Endrullis, Jeffrey O. Shallit, Tim Smith:
Undecidability and Finite Automata. 160-172 - Zsolt Gazdag, Krisztián Tichler:
On the Power of Permitting Semi-conditional Grammars. 173-184 - François Gonze, Vladimir V. Gusev, Balázs Gerencsér, Raphaël M. Jungers, Mikhail V. Volkov:
On the Interplay Between Babai and Černý's Conjectures. 185-197 - Anaël Grandjean:
Differences Between 2D Neighborhoods According to Real Time Computation. 198-209 - Luisa Herrmann:
A Medvedev Characterization of Recognizable Tree Series. 210-221 - Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$. 222-234 - Oscar H. Ibarra, Ian McQuillan:
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties. 235-246 - Michal Kunc, Jan Meitner:
The Generalized Rank of Trace Languages. 247-259 - Kamal Lodaya, A. V. Sreejith:
Two-Variable First Order Logic with Counting Quantifiers: Complexity Results. 260-271 - Frantisek Mráz, Friedrich Otto:
Deleting Deterministic Restarting Automata with Two Windows. 272-283 - Timothy Ng, David Rappaport, Kai Salomaa:
Relative Prefix Distance Between Languages. 284-295 - Elena A. Petrova, Arseny M. Shur:
On the Tree of Binary Cube-Free Words. 296-307 - Giovanni Pighizzini, Luca Prigioniero:
Limited Automata and Unary Languages. 308-319 - Gwénaël Richomme:
A Characterization of Infinite LSP Words. 320-331 - Alexander A. Rubtsov, Mikhail N. Vyalyi:
On Computational Complexity of Set Automata. 332-344 - Josef Rukavicka:
On the Number of Rich Words. 345-352 - Tomoyuki Yamakami:
One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity - (Preliminary Report). 353-364 - Hans Zantema, Wieb Bosma:
Classifying Non-periodic Sequences by Permutation Transducers. 365-377
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-01-10 18:42 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:
