Остановите войну!
for scientists:
default search action
Search 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 34 matches
- 2017
- 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. LATA 2017: 3-26 - Johanna Björklund, Loek Cleophas:
Minimization of Finite State Automata Through Partition Aggregation. LATA 2017: 223-235 - Davide Bresolin, Ivan Lanese:
Most General Property-Preserving Updates. LATA 2017: 367-379 - Benedikt Brütsch, Patrick Landwehr, Wolfgang Thomas:
N-Memory Automata over the Alphabet N. LATA 2017: 91-102 - Janusz A. Brzozowski, Corwin Sinnamon:
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages. LATA 2017: 171-182 - Giovanni Casu, G. Michele Pinna:
Merging Relations: A Way to Compact Petri Nets' Behaviors Uniformly. LATA 2017: 325-337 - Haiming Chen, Ping Lu:
Derivatives and Finite Automata of Expressions in Star Normal Form. LATA 2017: 236-248 - Nariyoshi Chida, Kimio Kuramitsu:
Linear Parsing Expression Grammars. LATA 2017: 275-286 - Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
On the Complexity of Hard Enumeration Problems. LATA 2017: 183-195 - Flavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan:
On Finite-Index Indexed Grammars and Their Restrictions. LATA 2017: 287-298 - Henk Don, Hans Zantema:
Finding DFAs with Maximal Shortest Synchronizing Word Length. LATA 2017: 249-260 - Bernd Gärtner, Ahad N. Zehmakan:
Color War: Cellular Automata with Majority-Rule. LATA 2017: 393-404 - Stefan Gerdjikov, Stoyan Mihov:
Over Which Monoids is the Transducer Determinization Procedure Applicable? LATA 2017: 380-392 - Georg Gottlob, Christoph Koch, Andreas Pieris:
Logic, Languages, and Rules for Web Data Extraction and Reasoning over Data. LATA 2017: 27-47 - Dick Grune, Wan J. Fokkink, Evangelos Chatzikalymnios, Brinio Hond, Peter Rutgers:
Detecting Useless Transitions in Pushdown Automata. LATA 2017: 421-434 - Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Consensus String Problem for Multiple Regular Languages. LATA 2017: 196-207 - Thomas Troels Hildebrandt, Christian Johansen, Håkon Normann:
A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus. LATA 2017: 51-63 - Mika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz:
On the Computational Power of Affine Automata. LATA 2017: 405-417 - Lisa Hutschenreiter, Rafael Peñaloza:
An Automata View to Goal-Directed Methods. LATA 2017: 103-114 - Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis:
Efficient Pattern Matching in Elastic-Degenerate Texts. LATA 2017: 131-142 - Adam Jardine, Kevin McMullin:
Efficient Learning of Tier-Based Strictly k-Local Languages. LATA 2017: 64-76 - Makoto Kanazawa, Ryo Yoshinaka:
The Strong, Weak, and Very Weak Finite Context and Kernel Properties. LATA 2017: 77-88 - Shmuel T. Klein, Dana Shapira:
Integrated Encryption in Dynamic Arithmetic Compression. LATA 2017: 143-154 - Dusan Knop:
Partitioning Graphs into Induced Subgraphs. LATA 2017: 338-350 - Manasi S. Kulkarni, Kalpana Mahalingam:
Two-Dimensional Palindromes and Their Properties. LATA 2017: 155-167 - Ruggero Lanotte, Massimo Merro:
A Calculus of Cyber-Physical Systems. LATA 2017: 115-127 - Chunmiao Li, Xiaojuan Cai:
Hardness Results for Coverability Problem of Well-Structured Pushdown Systems. LATA 2017: 435-446 - Mark-Jan Nederhof, Anssi Yli-Jyrä:
A Derivational Model of Discontinuous Parsing. LATA 2017: 299-310 - Adrien Pommellet, Marcio Diaz, Tayssir Touili:
Reachability Analysis of Pushdown Systems with an Upper Stack. LATA 2017: 447-459 - Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil:
Space Complexity of Reachability Testing in Labelled Graphs. LATA 2017: 351-363
skipping 4 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-07-03 03:02 CEST 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