default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 35 matches
- 2019
- Markus Holzer
, Michal Hospodár:
The Range of State Complexities of Languages Resulting from the Cut Operation. LATA 2019: 190-202 - Ondrej Klíma, Libor Polák:
On Varieties of Ordered Automata. LATA 2019: 108-120 - Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery:
Closure and Nonclosure Properties of the Compressible and Rankable Sets. LATA 2019: 177-189 - Amazigh Amrane, Nicolas Bedon:
Logic and Rational Languages of Scattered and Countable Series-Parallel Posets. LATA 2019: 275-287 - Malek Anabtawi, Sabit Hassan, Christos A. Kapoutsis, Mohammad Zakzok:
An Oracle Hierarchy for Small One-Way Finite Automata. LATA 2019: 57-69 - Marcella Anselmo, Maria Madonia, Carla Selmi:
Toroidal Codes and Conjugate Pictures. LATA 2019: 288-301 - Tim Becker, Klaus Sutner:
Orbits of Abelian Automaton Groups. LATA 2019: 70-81 - Alex Bishop, Murray Elder:
Bounded Automata Groups are co-ET0L. LATA 2019: 82-94 - Iovka Boneva, Joachim Niehren, Momar Sakho:
Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables. LATA 2019: 343-355 - Émilie Charlier, Svetlana Puzynina, Élise Vandomme:
Recurrence in Multidimensional Words. LATA 2019: 397-408 - Christophe Cordero:
A Note with Computer Exploration on the Triangle Conjecture. LATA 2019: 409-420 - Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Luciano Margara, Antonio E. Porreca:
Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automata. LATA 2019: 95-107 - Jean-Philippe Dubernard, Giovanna Guaiana, Ludovic Mignot:
Geometrical Closure of Binary V_3/2 Languages. LATA 2019: 302-314 - Ajay Kumar Eeralla, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen:
Rule-Based Unification in Combined Theories and the Finite Variant Property. LATA 2019: 356-367 - Stephen A. Fenner, Daniel Padé:
Complexity of Regex Crosswords. LATA 2019: 215-230 - Henning Fernau:
Modern Aspects of Complexity Within Formal Languages. LATA 2019: 3-30 - Berthold Hoffmann, Mark Minas:
Generalized Predictive Shift-Reduce Parsing for Hyperedge Replacement Graph Grammars. LATA 2019: 233-245 - Galina Jirásková, Ondrej Klíma:
Deterministic Biautomata and Subclasses of Deterministic Linear Languages. LATA 2019: 315-327 - Lila Kari, Timothy Ng:
State Complexity of Pseudocatenation. LATA 2019: 203-214 - Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Efficient Representation and Counting of Antipower Factors in Words. LATA 2019: 421-433 - Hans-Jörg Kreowski, Sabine Kuske, Aaron Lye:
Transformation of Petri Nets into Context-Dependent Fusion Grammars. LATA 2019: 246-258 - Edward A. Lee:
Observation and Interaction - Invited Paper. LATA 2019: 31-42 - Alexis Linard, Colin de la Higuera, Frits W. Vaandrager:
Learning Unions of k-Testable Languages. LATA 2019: 328-339 - Vadim V. Lozin:
From Words to Graphs, and Back. LATA 2019: 43-54 - Kalpana Mahalingam, Palak Pandoh:
On the Maximum Number of Distinct Palindromic Sub-arrays. LATA 2019: 434-446 - Klaus Meer, Ameen Naif:
Automata over Infinite Sequences of Reals. LATA 2019: 121-133 - Clemens Müllner, Andrew Ryzhikov:
Palindromic Subsequences in Finite Words. LATA 2019: 460-468 - Pawel Parys:
Extensions of the Caucal Hierarchy? LATA 2019: 368-380 - Wojciech Rytter, Wiktor Zuba:
Syntactic View of Sigma-Tau Generation of Permutations. LATA 2019: 447-459 - Ryoma Senda, Yoshiaki Takata, Hiroyuki Seki:
Generalized Register Context-Free Grammars. LATA 2019: 259-271
skipping 5 more matches
loading more results 
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-08 06:29 CET from data curated 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:
