Остановите войну!
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 18 matches
- 2009
- Miklós Bartha:
Equivalence Relations of Mealy Automata. NCMA 2009: 31-46 - Luca Bernardinello, Carlo Ferigato, Lucia Pomello, Stefania Rombolà:
Closure Operators Associated to Partially Ordered Sets. NCMA 2009: 47-60 - Maria Paola Bianchi, Beatrice Palano:
Events and Languages on Unary Quantum Automata. NCMA 2009: 61-76 - Peter Cerno, Frantisek Mráz:
Clearing Restarting Automata. NCMA 2009: 77-90 - Jürgen Dassow, Gema M. Martín, Francisco J. Vico:
Evolving Under Small Disruption. NCMA 2009: 91-106 - Rudolf Freund, Marian Kogler, Sergey Verlan:
P Automata with Controlled Use of Minimal Communication Rules. NCMA 2009: 107-120 - Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini:
One Pebble Versus log(n) Bits. NCMA 2009: 121-134 - Felix G. Hamza-Lup, Ferucio Laurentiu Tiplea:
An Automaton-based Formalism for Cooperative Augmented Reality Systems. NCMA 2009: 135-150 - Hendrik Jan Hoogeboom:
Automata Walking over Trees and Graphs. NCMA 2009: 11-14 - Galina Jirásková, Pavol Olejár:
State Complexity of Intersection and Union of Suffix-Free Languages and Descriptional Complexity. NCMA 2009: 151-166 - Peter Leupold, Benedek Nagy:
5' → 3' Watson-Crick Automata with Several Runs. NCMA 2009: 167-180 - Tomás Masopust:
Regulated Nondeterminism in PDAs: The Non-Regular Case. NCMA 2009: 181-194 - Joachim Niehren:
Streaming Tree Automata and XPath. NCMA 2009: 15-16 - Hidenosuke Nishio:
Automorphism Classification of Cellular Automata. NCMA 2009: 195-208 - Klaus Sutner:
Cellular Automata, Decidability and Phasespace. NCMA 2009: 17-30 - Catalin Ionut Tîrnauca:
Model Syntax-Directed Translations by Tree Transducers. NCMA 2009: 209-220 - Bianca Truthe:
Target Based Accepting Networks of Evolutionary Processors with Regular Filters. NCMA 2009: 221-236 - Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto:
Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings. books@ocg.at 256, Austrian Computer Society 2009, ISBN 978-3-85403-256-4 [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-07-19 21:15 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