Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11. LATA 2017: Umeå, Sweden
- Frank Drewes, Carlos Martín-Vide, Bianca Truthe
:
Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings. Lecture Notes in Computer Science 10168, 2017, ISBN 978-3-319-53732-0
Invited Talks
- Franz Baader, Oliver Fernandez Gil, Pavlos Marantidis:
Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in FL_0. 3-26 - Georg Gottlob, Christoph Koch, Andreas Pieris:
Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data. 27-47
Algorithmic Learning and Semantics
- Thomas Troels Hildebrandt, Christian Johansen, Håkon Normann:
A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus. 51-63 - Adam Jardine, Kevin McMullin:
Efficient Learning of Tier-Based Strictly k-Local Languages. 64-76 - Makoto Kanazawa, Ryo Yoshinaka:
The Strong, Weak, and Very Weak Finite Context and Kernel Properties. 77-88
Automata and Logics
- Benedikt Brütsch, Patrick Landwehr, Wolfgang Thomas:
N-Memory Automata over the Alphabet N. 91-102 - Lisa Hutschenreiter, Rafael Peñaloza:
An Automata View to Goal-Directed Methods. 103-114 - Ruggero Lanotte, Massimo Merro:
A Calculus of Cyber-Physical Systems. 115-127
Combinatorics on Words, Compression, and Pattern Matching
- Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis:
Efficient Pattern Matching in Elastic-Degenerate Texts. 131-142 - Shmuel T. Klein, Dana Shapira:
Integrated Encryption in Dynamic Arithmetic Compression. 143-154 - Manasi S. Kulkarni, Kalpana Mahalingam:
Two-Dimensional Palindromes and Their Properties. 155-167
Complexity
- Janusz A. Brzozowski, Corwin Sinnamon:
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages. 171-182 - Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
On the Complexity of Hard Enumeration Problems. 183-195 - Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Consensus String Problem for Multiple Regular Languages. 196-207 - Johannes Schmidt:
The Weight in Enumeration. 208-219
Finite Automata
- Johanna Björklund, Loek Cleophas:
Minimization of Finite State Automata Through Partition Aggregation. 223-235 - Haiming Chen, Ping Lu:
Derivatives and Finite Automata of Expressions in Star Normal Form. 236-248 - Henk Don, Hans Zantema:
Finding DFAs with Maximal Shortest Synchronizing Word Length. 249-260 - Hellis Tamm, Brink van der Merwe:
Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited. 261-272
Grammars, Languages, and Parsing
- Nariyoshi Chida, Kimio Kuramitsu:
Linear Parsing Expression Grammars. 275-286 - Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan:
On Finite-Index Indexed Grammars and Their Restrictions. 287-298 - Mark-Jan Nederhof, Anssi Yli-Jyrä:
A Derivational Model of Discontinuous Parsing. 299-310 - Jirí Síma, Petr Savický:
Cut Languages in Rational Bases. 311-322
Graphs and Petri Nets
- Giovanni Casu, G. Michele Pinna:
Merging Relations: A Way to Compact Petri Nets' Behaviors Uniformly. 325-337 - Dusan Knop:
Partitioning Graphs into Induced Subgraphs. 338-350 - Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil:
Space Complexity of Reachability Testing in Labelled Graphs. 351-363
Non-classical Automata
- Davide Bresolin, Ivan Lanese:
Most General Property-Preserving Updates. 367-379 - Stefan Gerdjikov, Stoyan Mihov:
Over Which Monoids is the Transducer Determinization Procedure Applicable? 380-392 - Bernd Gärtner, Ahad N. Zehmakan:
Color War: Cellular Automata with Majority-Rule. 393-404 - Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz:
On the Computational Power of Affine Automata. 405-417
Pushdown Automata and Systems
- Dick Grune, Wan J. Fokkink, Evangelos Chatzikalymnios, Brinio Hond, Peter Rutgers:
Detecting Useless Transitions in Pushdown Automata. 421-434 - Chunmiao Li, Xiaojuan Cai:
Hardness Results for Coverability Problem of Well-Structured Pushdown Systems. 435-446 - Adrien Pommellet, Marcio Diaz, Tayssir Touili:
Reachability Analysis of Pushdown Systems with an Upper Stack. 447-459
a service of 
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 2024-06-10 21:35 CEST 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:
