default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID39. MFCS 2014: Budapest, Hungary
- Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik:
Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I. Lecture Notes in Computer Science 8634, Springer 2014, ISBN 978-3-662-44521-1
Invited Contributions
- Krishnendu Chatterjee:
Partial-Observation Stochastic Reachability and Parity Games. 1-4 - Cyril Nicaud:
Random Deterministic Automata. 5-23 - Alexander A. Sherstov:
Communication Complexity Theory: Thirty-Five Years of Set Disjointness. 24-43 - Christian Sohler:
What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure? 44-49
Logic, Semantics, Automata and Theory of Programming
- Faried Abu Zaid, Erich Grädel, Martin Grohe
, Wied Pakusa:
Choiceless Polynomial Time on Structures with Small Abelian Colour Classes. 50-62 - Marie-Pierre Béal, Michel Blockelet, Catalin Dima:
Sofic-Dyck Shifts. 63-74 - Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
A Logical Characterization of Timed (non-)Regular Languages. 75-86 - Achim Blumensath, Olivier Carton, Thomas Colcombet:
Asymptotic Monadic Second-Order Logic. 87-98 - Pierre Bourhis, Michael Morak, Andreas Pieris:
Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules. 99-110 - Florian Bruse:
Alternating Parity Krivine Automata. 111-122 - Daniel Bundala, Joël Ouaknine:
Advances in Parametric Real-Time Reasoning. 123-134 - Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino:
Universal Lyndon Words. 135-146 - Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
Subword Complexity and Decomposition of the Set of Factors. 147-158 - Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni:
Cyclic Complexity of Words. 159-170 - Namit Chaturvedi, Marcus Gelderie:
Classifying Recognizable Infinitary Trace Languages Using Word Automata. 171-182 - Yijia Chen, Moritz Müller:
Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch's Theorem. 183-195 - Christian Choffrut, Bruno Guillon:
An Algebraic Characterization of Unary Two-Way Transducers. 196-207 - Thomas Colcombet, Laure Daviaud, Florian Zuleger:
Size-Change Abstraction and Max-Plus Automata. 208-219 - Jean-Baptiste Courtois, Sylvain Schmitz:
Alternating Vector Addition Systems with States. 220-231 - Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach - (Extended Abstract). 232-243 - Jesús Domínguez, Maribel Fernández:
Relating Nominal and Higher-Order Rewriting. 244-255 - Kord Eickmeyer, Michael Elberfeld, Frederik Harwath:
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures. 256-266 - Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj:
Two Recursively Inseparable Problems for Probabilistic Automata. 267-278 - Nathanaël Fijalkow, Charles Paperman:
Monadic Second-Order Logic with Arbitrary Monadic Predicates. 279-290 - Viliam Geffert, Alexander Okhotin:
Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata. 291-302 - Tomasz Gogacz, Henryk Michalewski, Matteo Mio, Michal Skrzypczak:
Measure Properties of Game Tree Languages. 303-314 - Stepan Holub, Galina Jirásková, Tomás Masopust:
On Upper and Lower Bounds on the Length of Alternating Towers. 315-326 - Furio Honsell, Luigi Liquori, Ivan Scagnetto:
L ax F: Side Conditions and External Evidence as Monads. 327-339 - Martin Huschenbett, Dietrich Kuske, Georg Zetzsche:
The Monoid of Queue Actions. 340-351 - Timo Jolivet, Jarkko Kari:
Undecidable Properties of Self-affine Sets and Multi-tape Automata. 352-364 - Emanuel Kieronski, Antti Kuusisto:
Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality. 365-376 - Salvatore La Torre, Margherita Napoli, Gennaro Parlato:
A Unifying Approach for Multistack Pushdown Automata. 377-389 - Martin Lang, Christof Löding, Amaldev Manuel:
Definability and Transformations for Cost Logics and Automatic Structures. 390-401 - Florin Manea, Mike Müller, Dirk Nowotka, Shinnosuke Seki:
Generalised Lyndon-Schützenberger Equations. 402-413 - Ines Marusic, James Worrell:
Complexity of Equivalence and Learning for Multiplicity Tree Automata. 414-425 - Filip Mazowiecki, Filip Murlak, Adam Witkowski:
Monadic Datalog and Regular Tree Pattern Queries. 426-437 - Roy Mennicke:
Model Checking Concurrent Recursive Programs Using Temporal Logics. 438-450 - Angelo Montanari, Gabriele Puppis, Pietro Sala:
Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals. 451-463 - Andrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos:
Reachability in Pushdown Register Automata. 464-473 - Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty:
A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures. 474-485 - Sven Schewe, Thomas Varghese:
Determinising Parity Automata. 486-498 - Sven Schewe, Thomas Varghese:
Tight Bounds for Complementing Parity Automata. 499-510 - Tim Smith:
On Infinite Words Determined by Indexed Languages. 511-522 - Tim Smith:
A Pumping Lemma for Two-Way Finite Transducers. 523-534 - Michal Wrona:
Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems. 535-546 - Thomas Zeume:
The Dynamic Descriptive Complexity of k-Clique. 547-558
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-11-09 22:54 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:
