Остановите войну!
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 36 matches
- 2001
- Sheng Yu, Andrei Paun:
Implementation and Application of Automata, 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers. Lecture Notes in Computer Science 2088, Springer 2001, ISBN 3-540-42491-1 [contents] - 2000
- Anne Bergeron, Sylvie Hamel:
Fast Implementations of Automata Computations. CIAA 2000: 47-56 - Anne Brüggemann-Klein, Derick Wood:
Regularly Extended Two-Way Nondeterministic Tree Automata. CIAA 2000: 57-66 - Pascal Caron, Marianne Flouret:
Glushkov Construction for Multiplicities. CIAA 2000: 67-79 - Jean-Marc Champarnaud:
Implicit Structures to Implement NFA's from Regular Expressions. CIAA 2000: 80-93 - Jean-Marc Champarnaud, Djelloul Ziadi:
New Finite Automaton Constructions Based on Canonical Derivatives. CIAA 2000: 94-104 - Jan Daciuk:
Experiments with Automata Compression. CIAA 2000: 105-112 - Stephan Diehl, Andreas Kerren, Torsten Weller:
Visual Exploration of Generation Algorithms for Finite Automata on the Web. CIAA 2000: 327-328 - Frank Drewes, Sigrid Ewert, Renate Klempien-Hinrichs, Hans-Jörg Kreowski:
Computing Raster Images from Grid Picture Grammars. CIAA 2000: 113-121 - Frank Drewes, Renate Klempien-Hinrichs:
TREEBAG. CIAA 2000: 329-330 - Jiri Dvorský, Václav Snásel:
Word Random Access Compression. CIAA 2000: 331-332 - Jacques Farré, José Fortes Gálvez:
A Basis for Looping Extensions to Discriminating-Reverse Parsing. CIAA 2000: 122-134 - Manuel Vilares Ferro, Victor M. Darriba, Francisco J. Ribadas:
Regional Least-Cost Error Repair. CIAA 2000: 293-301 - Tamás Gaál:
Extended Sequentialization of Transducers. CIAA 2000: 333-334 - David Harel, Hillel Kugler:
Synthesizing State-Based Object Systems from LSC Specifications. CIAA 2000: 1-33 - Pierre-Cyrille Héam:
Automata for Pro-V Topologies. CIAA 2000: 135-144 - Oscar H. Ibarra:
Reachability and Safety in Queue Systems. CIAA 2000: 145-156 - Oscar H. Ibarra, Jianwen Su:
Generalizing the Discrete Timed Automaton. CIAA 2000: 157-169 - J. Howard Johnson:
Lessons from INR in the Specification of Transductions. CIAA 2000: 335-336 - Lauri Karttunen:
Applications of Finite-State Transducers in Natural Language Processing. CIAA 2000: 34-46 - André Kempe:
Factorization of Ambiguous Finite-State Transducers. CIAA 2000: 170-181 - André Kempe:
Part-of-Speech Tagging with Two Sequential Transducers. CIAA 2000: 337-339 - Nils Klarlund, Anders Møller, Michael I. Schwartzbach:
MONA Implementation Secrets. CIAA 2000: 182-194 - Kamal Lodaya, Ramaswamy Ramanujam:
An Automaton Model of User-Controlled Navigation on the Web. CIAA 2000: 208-216 - Vincent Le Maout:
Cursors. CIAA 2000: 195-207 - Stoyan Mihov, Denis Maurel:
Direct Construction of Minimal Acyclic Subsequential Transducers. CIAA 2000: 217-229 - Mehryar Mohri:
Generic epsilon -Removal Algorithm for Weighted Automata. CIAA 2000: 230-242 - João José Neto:
Solving Complex Problems Efficiently with Adaptive Automata. CIAA 2000: 340-342 - Andrei Paun, Nicolae Santean, Sheng Yu:
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA 2000: 243-251 - Giovanni Pighizzini:
Unary Language Concatenation and Its State Complexity. CIAA 2000: 252-262
skipping 6 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-05-02 12:21 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