Остановите войну!
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 17 matches
- 2013
- Larbi Abdenebaoui, Hans-Jörg Kreowski, Sabine Kuske:
Graph-transformational swarms. NCMA 2013: 35-50 - Mikhail Barash:
Programming language specification by a grammar with contexts. NCMA 2013: 51-67 - Henrik Björklund, Petter Ericson:
A note on the complexity of deterministic tree-walking transducers. NCMA 2013: 69-83 - Peter Cerno:
Grammatical inference of lambda-confluent context rewriting systems. NCMA 2013: 85-100 - Erzsébet Csuhaj-Varjú:
P Automata: Automata-like constructs modeling complex natural systems. NCMA 2013: 13-30 - Manfred Droste, Doreen Götze:
The support of nested weighted automata. NCMA 2013: 101-116 - Henning Fernau, Markus L. Schmid, K. G. Subramanian:
Two-dimensional pattern languages. NCMA 2013: 117-132 - Rudolf Freund, Marion Oswald:
Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness. NCMA 2013: 133-150 - Viliam Geffert, Alexander Okhotin:
One-way simulation of two-way finite automata over small alphabets. NCMA 2013: 151-162 - Petr Hoffmann:
Power of S-kR-RRWW-automata. NCMA 2013: 163-178 - Markus Holzer, Sebastian Jakobi:
Minimization and characterizations for biautomata. NCMA 2013: 179-193 - Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt:
Deterministic one-way Turing machines with sublinear space bounds. NCMA 2013: 195-208 - Alexander Okhotin, Kai Salomaa:
Input-driven pushdown automata: nondeterminism and unambiguity. NCMA 2013: 31-33 - Giovanni Pighizzini, Andrea Pisoni:
Limited automata and context-free languages. NCMA 2013: 209-223 - Bianca Truthe:
Computationally complete chains of evolutionary processors with random context filters. NCMA 2013: 225-241 - Marcel Vollweiler:
Asynchronous systems of parallel communicating finite automata. NCMA 2013: 243-257 - Suna Bensch, Frank Drewes, Rudolf Freund, Friedrich Otto:
Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13 - August 14, 2013, Proceedings. books@ocg.at 294, Österreichische Computer Gesellschaft 2013, ISBN 978-3-85403-294-6 [contents]
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-27 18:09 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