Остановите войну!
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 31 matches
- 2007
- Franziska Biegler:
Synchronization Functions of Synchronized Context-Free Grammars and Languages. J. Autom. Lang. Comb. 12(1-2): 7-24 (2007) - Henning Bordihn, Henning Fernau:
The Degree of Parallelism. J. Autom. Lang. Comb. 12(1-2): 25-47 (2007) - Henning Bordihn, Bettina Sunckel:
On Active Symbols in CD Grammar Systems. J. Autom. Lang. Comb. 12(1-2): 49-67 (2007) - Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
A Family of NFAs Free of State Reductions. J. Autom. Lang. Comb. 12(1-2): 69-78 (2007) - Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit:
Enumeration of Context-Free Languages and Related Structures. J. Autom. Lang. Comb. 12(1-2): 79-95 (2007) - Frank Drewes, Heiko Vogler:
Learning Deterministically Recognizable Tree Series. J. Autom. Lang. Comb. 12(3): 332-354 (2007) - Manfred Droste, Heiko Vogler:
Editorial. J. Autom. Lang. Comb. 12(4): 433 (2007) - Berke Durak:
Two-Way Finite Automata with a Write-Once Track. J. Autom. Lang. Comb. 12(1-2): 97-115 (2007) - Zoltán Ésik, Werner Kuich:
A Semiring-Semimodule Generalization of Transducers and Abstract omega-Families of Power Series. J. Autom. Lang. Comb. 12(4): 435-454 (2007) - Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt:
Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars. J. Autom. Lang. Comb. 12(1-2): 117-138 (2007) - Viliam Geffert:
State Hierarchy for One-Way Finite Automata. J. Autom. Lang. Comb. 12(1-2): 139-145 (2007) - Gregor Gramlich, Ralf Herrmann:
Learning Unary Automata. J. Autom. Lang. Comb. 12(1-2): 147-165 (2007) - Miguel Angel Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez:
Multi-dimensional Descriptional Complexity of P Systems. J. Autom. Lang. Comb. 12(1-2): 167-179 (2007) - Yo-Sub Han, Gerhard Trippen, Derick Wood:
Simple-Regular Expressions and Languages. J. Autom. Lang. Comb. 12(1-2): 181-194 (2007) - Markus Holzer, Martin Kutrib, Jens Reimann:
Non-Recursive Trade-Offs for Deterministic Restarting Automata. J. Autom. Lang. Comb. 12(1-2): 195-213 (2007) - Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel:
Monotonicity of Restarting Automata. J. Autom. Lang. Comb. 12(3): 355-371 (2007) - Christos A. Kapoutsis:
Deterministic Moles Cannot Solve Liveness. J. Autom. Lang. Comb. 12(1-2): 215-235 (2007) - Miklós Krész:
Graph Decomposition and Descriptional Complexity of Soliton Automata. J. Autom. Lang. Comb. 12(1-2): 237-263 (2007) - Ruggero Lanotte:
Expressive Power of Hybrid Systems with Real Variables, Integer Variables and Arrays. J. Autom. Lang. Comb. 12(3): 373-405 (2007) - Andreas Malcher:
On Recursive and Non-recursive Trade-Offs between Finite-Turn Pushdown Automata. J. Autom. Lang. Comb. 12(1-2): 265-277 (2007) - Giovanni Pighizzini, Detlef Wotschke:
Editorial. J. Autom. Lang. Comb. 12(1-2): 5 (2007) - Libor Polák:
Remarks on Multiple Entry Deterministic Finite Automata. J. Autom. Lang. Comb. 12(1-2): 279-288 (2007) - George Rahonis:
Weighted Muller Tree Automata and Weighted Logics. J. Autom. Lang. Comb. 12(4): 455-483 (2007) - Daniel Reidenbach:
An Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-Pattern Languages. J. Autom. Lang. Comb. 12(3): 407-426 (2007) - Sibylle Schwarz:
Lukasiewicz Logic and Weighted Logics over MV-Semirings. J. Autom. Lang. Comb. 12(4): 485-499 (2007) - Bettina Sunckel:
On the Descriptional Complexity of CD Grammar Systems of Finite Index. J. Autom. Lang. Comb. 12(1-2): 289-306 (2007) - Catalin Ionut Tîrnauca, Cristina Tîrnauca:
Learning Regular Tree Languages from Correction and Equivalence Queries. J. Autom. Lang. Comb. 12(4): 501-524 (2007) - German Tischler:
On Computability and some Decision Problems of Parametric Weighted Finite Automata. J. Autom. Lang. Comb. 12(4): 525-544 (2007) - György Vaszil:
Non-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components. J. Autom. Lang. Comb. 12(1-2): 307-315 (2007) - Sergey Verlan:
On Minimal Context-Free Insertion-Deletion Systems. J. Autom. Lang. Comb. 12(1-2): 317-328 (2007)
skipping 1 more match
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-05-30 06:03 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