![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 27 matches
- 2021
- David R. Bélanger, Ziyuan Gao, Sanjay Jain
, Wei Li, Frank Stephan:
Learnability and Positive Equivalence Relations. LATA 2021: 145-156 - Fabian Birkmann, Stefan Milius
, Henning Urbat:
On Language Varieties Without Boolean Operations. LATA 2021: 3-15 - Borzoo Bonakdarpour
, Sarai Sheinvald
:
Finite-Word Hyperlanguages. LATA 2021: 173-186 - Sabine Broda
, António Machiavelo
, Nelma Moreira
, Rogério Reis
:
Location Based Automata for Expressions with Shuffle. LATA 2021: 43-54 - Sankardeep Chakraborty
, Roberto Grossi
, Kunihiko Sadakane
, Srinivasa Rao Satti
:
Succinct Representations for (Non)Deterministic Finite Automata. LATA 2021: 55-67 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding. LATA 2021: 241-254 - Francesco Dolce, L'ubomíra Dvoráková
, Edita Pelantová:
On Balanced Sequences and Their Asymptotic Critical Exponent. LATA 2021: 293-304 - Frederic Dörband
, Thomas Feller
, Kevin Stier
:
Approximated Determinisation of Weighted Tree Automata. LATA 2021: 255-266 - Frederic Dörband
, Thomas Feller
, Kevin Stier
:
Sequentiality of Group-Weighted Tree Automata. LATA 2021: 267-278 - Valentina Dorigatti, Paolo Massazza:
Partially Directed Animals with a Bounded Number of Holes. LATA 2021: 16-28 - Jens Oliver Gutsfeld, Markus Müller-Olm, Christian Dielitz:
Temporal Logics with Language Parameters. LATA 2021: 187-199 - Stefan Hoffmann
:
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words. LATA 2021: 305-317 - Stefan Hoffmann
:
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets. LATA 2021: 318-330 - Mamoru Ishizuka, Takahito Aoto
, Munehiro Iwami
:
Commutative Rational Term Rewriting. LATA 2021: 200-212 - Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan:
On the Computational Power of Programs over BA2 Monoid. LATA 2021: 29-40 - Aaron Lye:
Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete. LATA 2021: 97-108 - Takayuki Miyazaki
, Yasuhiko Minamide
:
Context-Free Grammars with Lookahead. LATA 2021: 213-225 - Hiroki Morizumi:
On the Power of Nondeterministic Circuits and Co-Nondeterministic Circuits. LATA 2021: 109-117 - Mikhail Mrykhin
, Alexander Okhotin
:
On Hardest Languages for One-Dimensional Cellular Automata. LATA 2021: 118-130 - Julian Pape-Lange
:
Cadences in Grammar-Compressed Strings. LATA 2021: 331-342 - Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
Optimising Attractor Computation in Boolean Automata Networks. LATA 2021: 68-80 - Semyon Petrov
, Alexander Okhotin
:
On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata. LATA 2021: 81-93 - Giovanni Pighizzini
, Branislav Rovan
, Simon Sádovský
:
Usefulness of Information and Unary Languages. LATA 2021: 131-142 - Bastien Sérée, Loïg Jezequel, Didier Lime:
An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs. LATA 2021: 279-290 - K. Subramani, Piotr Wojciechowski:
Tree-Like Unit Refutations in Horn Constraint Systems. LATA 2021: 226-237 - Frits W. Vaandrager, Roderick Bloem, Masoud Ebrahimi:
Learning Mealy Machines with One Timer. LATA 2021: 157-170 - Alberto Leporati
, Carlos Martín-Vide
, Dana Shapira
, Claudio Zandron
:
Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, Proceedings. Lecture Notes in Computer Science 12638, Springer 2021, ISBN 978-3-030-68194-4 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-21 13:45 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