Остановите войну!
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 29 matches
- 2004
- Henning Bordihn, Markus Holzer, Martin Kutrib:
Economy of Description for Basic Constructions on Rational Transductions. J. Autom. Lang. Comb. 9(2/3): 175-188 (2004) - Cezar Câmpeanu, Wing Hong Ho:
The Maximum State Complexity for Finite Languages. J. Autom. Lang. Comb. 9(2/3): 189-202 (2004) - Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi:
Random Generation Models for NFAs. J. Autom. Lang. Comb. 9(2/3): 203-216 (2004) - Jürgen Dassow, Helmut Jürgensen, Detlef Wotschke:
Editorial. J. Autom. Lang. Comb. 9(2/3): 173 (2004) - Michael Domaratzki, Kai Salomaa:
State Complexity of Shuffle on Trajectories. J. Autom. Lang. Comb. 9(2/3): 217-232 (2004) - Zoltán Ésik, Zoltán L. Németh:
Higher Dimensional Automata. J. Autom. Lang. Comb. 9(1): 3-29 (2004) - Keith Ellul, Bryan Krawetz, Jeffrey O. Shallit, Ming-wei Wang:
Regular Expressions: New Results and Open Problems. J. Autom. Lang. Comb. 9(2/3): 233-256 (2004) - Mark G. Eramian:
Efficient Simulation of Nondeterministic Weighted Finite Automata. J. Autom. Lang. Comb. 9(2/3): 257-267 (2004) - Rudolf Freund, Marion Oswald:
P Systems with Conditional Communication Rules Assigned to Membranes. J. Autom. Lang. Comb. 9(4): 387-397 (2004) - Zoltán Fülöp, Heiko Vogler:
Weighted Tree Transducers. J. Autom. Lang. Comb. 9(1): 31-54 (2004) - Ferenc Gécseg, Balázs Imreh:
On Definite and Nilpotent DR Tree Languages. J. Autom. Lang. Comb. 9(1): 55-60 (2004) - Cristian Grozea:
NP Predicates Computable in the Weakest Level of the Grzegorczyck Hierarchy. J. Autom. Lang. Comb. 9(2/3): 269-279 (2004) - Giovanna Guaiana, Antonio Restivo, Sergio Salemi:
On the Trace Product and some Families of Languages Closed under Partial Commutations. J. Autom. Lang. Comb. 9(1): 61-79 (2004) - Helmut Jürgensen, Stavros Konstantinidis, Nguyen Huong Lam:
Asymptotically Optimal Low-Cost Solid Codes. J. Autom. Lang. Comb. 9(1): 81-102 (2004) - Martin Kappes, Chandra M. R. Kintala:
Tradeoffs Between Reliability and Conciseness of Deterministic Finite Automata. J. Autom. Lang. Comb. 9(2/3): 281-292 (2004) - Lila Kari, Stavros Konstantinidis:
Descriptional Complexity of Error/Edit Systems. J. Autom. Lang. Comb. 9(2/3): 293-309 (2004) - Sergey Kitaev, Toufik Mansour, Patrice Séébold:
Generating the Peano Curve and Counting Occurrences of some Patterns. J. Autom. Lang. Comb. 9(4): 439-455 (2004) - Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux:
Valence Languages Generated by Equality Sets. J. Autom. Lang. Comb. 9(4): 399-406 (2004) - Ian McQuillan:
Descriptional Complexity of Block-Synchronization Context-Free Grammars. J. Autom. Lang. Comb. 9(2/3): 317-332 (2004) - Charlotte Miller:
Context Derivation Sets and Context-Free Normal Forms. J. Autom. Lang. Comb. 9(2/3): 333-345 (2004) - Madhu Mutyam:
Descriptional Complexity of Rewriting P Systems. J. Autom. Lang. Comb. 9(2/3): 311-316 (2004) - Madhu Mutyam, Kamala Krithivasan:
Length Synchronization Context-Free Grammars. J. Autom. Lang. Comb. 9(4): 457-464 (2004) - Jean Néraud, Carla Selmi:
A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A*. J. Autom. Lang. Comb. 9(1): 103-110 (2004) - Frank Nießner:
Büchi Automata and Their Degrees of Nondeterminism and Ambiguity. J. Autom. Lang. Comb. 9(2/3): 347-363 (2004) - Alexander Okhotin:
State Complexity of Linear Conjunctive Languages. J. Autom. Lang. Comb. 9(2/3): 365-381 (2004) - Tomasz Jurdzinski, Krzysztof Lorys, Gundula Niemann, Friedrich Otto:
Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages. J. Autom. Lang. Comb. 9(4): 407-437 (2004) - Yasubumi Sakakibara, Hiroshi Imai:
A DNA-Based Computational Model Using a Specific Type of Restriction Enzymes. J. Autom. Lang. Comb. 9(1): 111-119 (2004) - Nicolae Santean:
Bimachines and Structurally-Reversed Automata. J. Autom. Lang. Comb. 9(1): 121-146 (2004) - Pascal Weil:
On the Logical Definability of Certain Graph and Poset Languages. J. Autom. Lang. Comb. 9(1): 147-165 (2004)
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-04-23 10:18 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