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 37 matches
- 2001
- Mouhamed Kadrie Ahmad, Xavier Augros:
Some Results on Codes for Generalized Factorizations. J. Autom. Lang. Comb. 6(3): 239-251 (2001) - Suna Aydin, Helmut Jürgensen, Lynda E. Robbins:
Dialogues as Co-Operating Grammars. J. Autom. Lang. Comb. 6(4): 395-410 (2001) - Valérie Berthé, Laurent Vuillon:
Palindromes and Two-Dimensional Sturmian Sequences. J. Autom. Lang. Comb. 6(2): 121-138 (2001) - Henning Bordihn, Markus Holzer:
On the Number of Active Symbols in L and CD Grammar Systems. J. Autom. Lang. Comb. 6(4): 411-426 (2001) - Douglas S. Bridges, Ayan Mahalanobis:
Increasing, Nondecreasing, and Virtually Continuous Functions. J. Autom. Lang. Comb. 6(2): 139-143 (2001) - Klaus Denecke, Jörg Koppitz, Slavcho Shtrakov:
The Depth of a Hypersubstitution. J. Autom. Lang. Comb. 6(3): 253-262 (2001) - Catalin Dima:
Real-Time Automata. J. Autom. Lang. Comb. 6(1): 3-23 (2001) - Pál Dömösi, Zoltán Ésik:
Homomorphic Simulation and Letichevsky's Criterion. J. Autom. Lang. Comb. 6(4): 427-436 (2001) - Zoltán Fülöp:
Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers. J. Autom. Lang. Comb. 6(2): 145-189 (2001) - Christian Glaßer, Heinz Schmitz:
The Boolean Structure of Dot-Depth One. J. Autom. Lang. Comb. 6(4): 437-452 (2001) - Yannick Guesnet:
On Maximal Dense Bifix Codes. J. Autom. Lang. Comb. 6(3): 263-273 (2001) - Pierre-Cyrille Héam:
Some Topological Properties of Rational Sets. J. Autom. Lang. Comb. 6(3): 275-290 (2001) - Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard:
Distributed Pattern Matching Using Finite Automata. J. Autom. Lang. Comb. 6(2): 191-201 (2001) - Markus Holzer, Kai Salomaa, Sheng Yu:
On the State Complexity of k-Entry Deterministic Finite Automata. J. Autom. Lang. Comb. 6(4): 453-466 (2001) - Costas S. Iliopoulos, Jamie Simpson:
On-Line Validation and Analysis of Partially Occluded Images. J. Autom. Lang. Comb. 6(3): 291-303 (2001) - Helmut Jürgensen:
Editorial. J. Autom. Lang. Comb. 6(4): 393 (2001) - Helmut Jürgensen, Masashi Katsura, Stavros Konstantinidis:
Maximal Solid Codes. J. Autom. Lang. Comb. 6(1): 25-50 (2001) - Andrei V. Kelarev, Olga Sokratova:
Directed Graphs and Syntactic Algebras of Tree Languages. J. Autom. Lang. Comb. 6(3): 305-311 (2001) - Rainer Kemp:
On the Expected Number of Leftist Nodes in Simply Generated Trees. J. Autom. Lang. Comb. 6(3): 313-343 (2001) - Bakhadyr Khoussainov, Sasha Rubin:
Graphs with Automatic Presentations over a Unary Alphabet. J. Autom. Lang. Comb. 6(4): 467-480 (2001) - Shankara Narayanan Krishna, Raghavan Rama:
P Systems with Replicated Rewriting. J. Autom. Lang. Comb. 6(3): 345-350 (2001) - Erkki Mäkinen:
On the Inclusion Problem for Very Simple Deterministic Pushdown Automata. J. Autom. Lang. Comb. 6(3): 351-357 (2001) - Vincenzo Manca, Carlos Martín-Vide, Gheorghe Paun:
On the Power of P Systems with Replicated Rewriting. J. Autom. Lang. Comb. 6(3): 359-374 (2001) - Massimiliano Milani, Giovanni Pighizzini:
Tight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata. J. Autom. Lang. Comb. 6(4): 481-492 (2001) - Frantisek Mráz:
Lookahead Hierarchies of Restarting Automata. J. Autom. Lang. Comb. 6(4): 493-506 (2001) - Markus E. Nebel:
On the Power of Subroutines for Finite State Machines. J. Autom. Lang. Comb. 6(1): 51-74 (2001) - Taishin Y. Nishida:
Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems. J. Autom. Lang. Comb. 6(4): 507-518 (2001) - Alexander Okhotin:
Conjunctive Grammars. J. Autom. Lang. Comb. 6(4): 519-535 (2001) - Friedrich Otto, Nikola Ruskuc:
Confluent Monadic String-Rewriting Systems and Automatic Structures. J. Autom. Lang. Comb. 6(3): 375-388 (2001) - Gheorghe Paun:
P Systems with Active Membranes: Attacking NP-Complete Problems. J. Autom. Lang. Comb. 6(1): 75-90 (2001)
skipping 7 more matches
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-10-20 10:29 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