default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18. DCFS 2016: Bucharest, Romania
- Cezar Câmpeanu, Florin Manea, Jeffrey O. Shallit:
Descriptional Complexity of Formal Systems - 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings. Lecture Notes in Computer Science 9777, Springer 2016, ISBN 978-3-319-41113-2 - Eugenija A. Bondar, Mikhail V. Volkov
:
Completely Reachable Automata. 1-17 - Gabriel Istrate, Cosmin Bonchis:
Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems. 18-28 - Galina Jirásková:
Self-Verifying Finite Automata and Descriptional Complexity. 29-44 - Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection. 45-59 - Janusz A. Brzozowski:
Unrestricted State Complexity of Binary Operations on Regular Languages. 60-72 - Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula:
On the State Complexity of the Shuffle of Regular Languages. 73-86 - Zoltán Ésik, Szabolcs Iván:
MSO-definable Properties of Muller Context-Free Languages Are Decidable. 87-97 - Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian:
Contextual Array Grammars with Matrix and Regular Control. 98-110 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems. 111-125 - Lukas Fleischer, Manfred Kufleitner:
Operations on Weakly Recognizing Morphisms. 126-137 - Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Descriptional Complexity of Bounded Regular Languages. 138-152 - Galina Jirásková, Alexander Szabari, Juraj Sebej:
The Complexity of Languages Resulting from the Concatenation Operation. 153-167 - Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero:
Minimal and Reduced Reversible Automata. 168-179 - Laurette Marais, Lynette van Zijl:
Unary Self-verifying Symmetric Difference Automata. 180-191 - Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Prefix Distance of Subregular Languages. 192-204 - Vojtech Vorel:
Two Results on Discontinuous Input Processing. 205-216
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-27 22:52 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:
