Остановите войну!
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 31 matches
- 2008
- Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar:
Composed Bisimulation for Tree Automata. CIAA 2008: 212-222 - Cyril Allauzen, Mehryar Mohri:
3-Way Composition of Weighted Finite-State Transducers. CIAA 2008: 262-273 - Marco Almeida, Nelma Moreira, Rogério Reis:
Antimirov and Mosses's Rewrite System Revisited. CIAA 2008: 46-56 - Andrew Badr:
Hyper-Minimization in O(n2). CIAA 2008: 223-231 - Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
The Number of Runs in Sturmian Words. CIAA 2008: 252-261 - Ahmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar:
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. CIAA 2008: 57-67 - François Cantin, Axel Legay, Pierre Wolper:
Computing Convex Hulls by Automata Iteration. CIAA 2008: 112-121 - Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne:
Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L). CIAA 2008: 68-77 - Ryan Dixon, Ömer Egecioglu, Timothy Sherwood:
Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning. CIAA 2008: 141-150 - Egor Dolzhenko, Natasa Jonoska:
On Complexity of Two Dimensional Languages Generated by Transducers. CIAA 2008: 181-190 - Khaled El-Fakih, Nina Yevtushenko:
Progressive Solutions to FSM Equations. CIAA 2008: 274-282 - Zoltán Ésik, Szabolcs Iván:
Games for Temporal Logics on Trees. CIAA 2008: 191-200 - Akio Fujiyoshi:
Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees. CIAA 2008: 283-285 - Pedro García, Manuel Vazquez de Parga, Gloria Inés Alvarez, José Ruiz:
Learning Regular Languages Using Nondeterministic Finite Automata. CIAA 2008: 92-101 - Rob J. van Glabbeek, Bas Ploeger:
Five Determinisation Algorithms. CIAA 2008: 161-170 - Harald Hempel, Madlen Kimmritz:
Persistent Computations of Turing Machines. CIAA 2008: 171-180 - Markus Holzer, Martin Kutrib:
Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. CIAA 2008: 1-16 - Kazuhiro Inaba, Haruo Hosoya, Sebastian Maneth:
Multi-Return Macro Tree Transducers. CIAA 2008: 102-111 - Jan Lahoda, Borivoj Melichar, Jan Zdárek:
Pattern Matching in DCA Coded Text. CIAA 2008: 151-160 - Andreas Maletti:
Tree-Series-to-Tree-Series Transformations. CIAA 2008: 132-140 - Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda:
A Run-Time Efficient Implementation of Compressed Pattern Matching Automata. CIAA 2008: 201-211 - Takuya Nishiyama, Yasuhiko Minamide:
A Translation from the HTML DTD into a Regular Hedge Grammar. CIAA 2008: 122-131 - Andrei Paun, Mihaela Paun, Alfonso Rodríguez-Patón:
Hopcroft's Minimization Technique: Queues or Stacks?. CIAA 2008: 78-91 - Giovanni Pighizzini:
Deterministic Pushdown Automata and Unary Languages. CIAA 2008: 232-241 - Benoît Razet:
Finite Eilenberg Machines. CIAA 2008: 242-251 - Kai Salomaa:
Language Decompositions, Primality, and Trajectory-Based Operations. CIAA 2008: 17-22 - Martin Simunek, Borivoj Melichar:
Approximate Periods with Levenshtein Distance. CIAA 2008: 286-287 - Yih-Kuen Tsay, Bow-Yaw Wang:
Automated Compositional Reasoning of Intuitionistically Closed Regular Properties. CIAA 2008: 36-45 - Mihalis Yannakakis:
Automata, Probability, and Recursion. CIAA 2008: 23-32 - Hsu-Chun Yen:
Concurrency, Synchronization, and Conflicts in Petri Nets. CIAA 2008: 33-35
skipping 1 more match
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-06-06 07:00 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