Остановите войну!
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 37 matches
- 2003
- Cyril Allauzen, Mehryar Mohri:
Efficient Algorithms for Testing the Twins Property. J. Autom. Lang. Comb. 8(2): 117-144 (2003) - M. Sakthi Balan, Kamala Krithivasan, Madhu Mutyam:
Some Variants in Communication of Parallel Communicating Pushdown Automata. J. Autom. Lang. Comb. 8(3): 401-416 (2003) - Sergey Bereg, Andrei V. Kelarev:
An Algorithm for Analysis of Images in Spatial Information Systems. J. Autom. Lang. Comb. 8(4): 557-565 (2003) - Stephen L. Bloom, Zoltán Ésik:
An Extension Theorem with an Application to Formal Tree Series. J. Autom. Lang. Comb. 8(2): 145-185 (2003) - Björn Borchardt, Heiko Vogler:
Determinization of Finite State Weighted Tree Automata. J. Autom. Lang. Comb. 8(3): 417-463 (2003) - Peter Buchholz, Peter Kemper:
Weak Bisimulation for (max/+) Automata and Related Models. J. Autom. Lang. Comb. 8(2): 187-218 (2003) - Nicholas J. Cavenagh:
Latin Trade Algorithms and the Smallest Critical Set in a Latin Square. J. Autom. Lang. Comb. 8(4): 567-578 (2003) - Flavio D'Alessandro:
On the Complexity of Simon Automata over the Dyck Language. J. Autom. Lang. Comb. 8(3): 465-476 (2003) - Mark Daley, Oscar H. Ibarra, Lila Kari, Ian McQuillan, Koji Nakano:
The LD and DLAD Bio-Operations on Formal Languages. J. Autom. Lang. Comb. 8(3): 477-498 (2003) - Jürgen Dassow:
Editorial. J. Autom. Lang. Comb. 8(1): 3-4 (2003) - Diane M. Donovan, Costas S. Iliopoulos, Mirka Miller:
Editorial. J. Autom. Lang. Comb. 8(4): 555 (2003) - Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski:
Computing Raster Images from Grid Picture Grammars. J. Autom. Lang. Comb. 8(3): 499-519 (2003) - Frank Drewes, Renate Klempien-Hinrichs, Hans-Jörg Kreowski:
Table-Driven and Context-Sensitive Collage Languages. J. Autom. Lang. Comb. 8(1): 5-24 (2003) - Manfred Droste, Heiko Vogler:
Editorial. J. Autom. Lang. Comb. 8(2): 115 (2003) - Dirk Ermel, Dietmar Wätjen:
Limited IL Systems. J. Autom. Lang. Comb. 8(1): 25-42 (2003) - Zoltán Ésik, Werner Kuich:
Formal Tree Series. J. Autom. Lang. Comb. 8(2): 219-285 (2003) - Chen-Ming Fan, Huei-Jan Shyr:
Languages Related to the Properties of Disjunctivity and Code. J. Autom. Lang. Comb. 8(3): 521-538 (2003) - Frantisek Franek, Jan Holub, William F. Smyth, Xiangdong Xiao:
Computing Quasi Suffix Arrays. J. Autom. Lang. Comb. 8(4): 593-606 (2003) - Frantisek Franek, William F. Smyth, Yudong Tang:
Computing all Repeats Using Suffix Arrays. J. Autom. Lang. Comb. 8(4): 579-591 (2003) - Balázs Imreh, Csanád Imreh, Masami Ito:
On Monotonic Directable Nondeterministic Automata. J. Autom. Lang. Comb. 8(3): 539-547 (2003) - Bakhadyr Khoussainov, Sasha Rubin:
Automatic Structures: Overview and Future Directions. J. Autom. Lang. Comb. 8(2): 287-301 (2003) - Sergey Kitaev:
There are no Iterated Morphisms that Define the Arshon Sequence and the σ-Sequence. J. Autom. Lang. Comb. 8(1): 43-50 (2003) - George Lagogiannis, Christos Makris, Yannis Panagis, Spyros Sioutas, Kostas Tsichlas:
New Dynamic Balanced Search Trees with Worst-Case Constant Update Time. J. Autom. Lang. Comb. 8(4): 607-632 (2003) - George Lagogiannis, Christos Makris, Yannis Panagis, Spyros Sioutas, Kostas Tsichlas:
Rectangle Enclosure Reporting in Linear Space Revisited. J. Autom. Lang. Comb. 8(4): 633-645 (2003) - Arnaud Lefebvre, Thierry Lecroq, Joël Alexandre:
An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle. J. Autom. Lang. Comb. 8(4): 647-657 (2003) - Jens Liebehenschel:
On the Connection Between Lexicographical Generation and Ranking. J. Autom. Lang. Comb. 8(1): 51-57 (2003) - Charles Curtis Lindner:
A Small Embedding for Partial 4-Cycle Systems when the Leave is Small. J. Autom. Lang. Comb. 8(4): 659-662 (2003) - Prabhu Manyem, Rhonda L. Salt, Marc Simon Visser:
Approximation Lower Bounds in Online LIB Bin Packing and Covering. J. Autom. Lang. Comb. 8(4): 663-674 (2003) - Carlos Martín-Vide, Victor Mitrana, Ralf Stiebe:
Weighted Grammars and Automata with Threshold Interpretation. J. Autom. Lang. Comb. 8(2): 303-318 (2003) - Elena Petre:
Watson-Crick ω-Automata. J. Autom. Lang. Comb. 8(1): 59-70 (2003)
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-08-06 01:32 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