default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22nd CIAA 2017: Marne-la-Vallée, France
- Arnaud Carayol, Cyril Nicaud:
Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Marne-la-Vallée, France, June 27-30, 2017, Proceedings. Lecture Notes in Computer Science 10329, Springer 2017, ISBN 978-3-319-60133-5
Abstracts of Invited Papers
- Véronique Cortier:
Electronic Voting: How Logic Can Help. xi-xii - Kim Guldstrand Larsen:
Timed and Untimed Energy Games. xiii-xvi - Damien Pous:
CoInductive Automata Algorithms. xvii-xviii
Contributed Papers
- Luca Aceto, Antonis Achilleos
, Adrian Francalanza, Anna Ingólfsdóttir, Sævar Örn Kjartansson:
On the Complexity of Determinizing Monitors. 1-13 - Martin Berglund, Brink van der Merwe, Bruce W. Watson, Nicolaas Weideman:
On the Semantics of Atomic Subgroups in Practical Regular Expressions. 14-26 - Henrik Björklund, Johanna Björklund, Petter Ericson:
On the Regularity and Learnability of Ordered DAG Languages. 27-39 - Henning Bordihn, Markus Holzer:
On the Number of Active States in Deterministic and Nondeterministic Finite Automata. 40-51 - Janusz A. Brzozowski, Corwin Sinnamon:
Complexity of Proper Prefix-Convex Regular Languages. 52-63 - Claudia Cauli, Nir Piterman:
Equivalence of Probabilistic \mu -Calculus and p-Automata. 64-75 - Robert Ferens, Marek Szykula:
Complexity of Bifix-Free Regular Languages. 76-88 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems. 89-100 - Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg:
Stamina: Stabilisation Monoids in Automata Theory. 101-112 - Stefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz:
A Simple Method for Building Bimachines from Functional Finite-State Transducers. 113-125 - Yo-Sub Han, Sang-Ki Ko:
Alignment Distance of Regular Tree Languages. 126-137 - Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
Nondeterministic Complexity of Operations on Free and Convex Languages. 138-150 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Transducing Reversibly with Finite State Machines. 151-162 - Louis-Marie Dando, Sylvain Lombardy:
From Hadamard Expressions to Weighted Rotating Automata and Back. 163-174 - Paolo Massazza:
On the Conjecture ℒDFCM ⊊ RCM. 175-187 - Andrew Ryzhikov:
Synchronization Problems in Automata Without Non-trivial Cycles. 188-200 - Marek Szykula, John Wittnebel:
Syntactic Complexity of Bifix-Free Languages. 201-212
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-01 15:17 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:
