![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 28 matches
- 2011
- Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves
, Pierre Réty:
Weak Inclusion for XML Types. CIAA 2011: 30-41 - Denis Béchet, Alexander Ja. Dikovsky, Annie Foret:
Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages. CIAA 2011: 42-52 - Erez Buchnik:
Bouma2 - A High-Performance Input-Aware Multiple String-Match Algorithm. CIAA 2011: 53-64 - Vincent Carnino, Sven De Felice:
Random Generation of Deterministic Acyclic Automata Using Markov Chains. CIAA 2011: 65-75 - José M. Castaño, Rodrigo Castaño:
Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability. CIAA 2011: 76-87 - Giusi Castiglione
, Antonio Restivo, Marinella Sciortino:
Nondeterministic Moore Automata and Brzozowski's Algorithm. CIAA 2011: 88-99 - Supaporn Chairungsee, Maxime Crochemore:
Building Phylogeny with Minimal Absent Words. CIAA 2011: 100-109 - Chih-Hong Cheng, Barbara Jobstmann, Christian Buckl
, Alois C. Knoll
:
On the Hardness of Priority Synthesis. CIAA 2011: 110-117 - Bruno Courcelle, Irène Durand:
Fly-Automata, Their Properties and Applications. CIAA 2011: 264-272 - Jan Daciuk, Dawid Weiss:
Smaller Representation of Finite State Automata. CIAA 2011: 118-129 - Ingo Felscher, Wolfgang Thomas:
Compositional Failure Detection in Structured Transition Systems. CIAA 2011: 130-141 - Tomás Flouri, Jan Janousek
, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis
:
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata. CIAA 2011: 273-281 - Olivier Gauwin, Joachim Niehren:
Streamable Fragments of Forward XPath. CIAA 2011: 3-15 - Pawel Gawrychowski:
Chrobak Normal Form Revisited, with Applications. CIAA 2011: 142-153 - Yo-Sub Han, Sang-Ki Ko
:
A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule. CIAA 2011: 154-165 - Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
:
Loops and Overloops for Tree Walking Automata. CIAA 2011: 166-177 - Markus Holzer
, Martin Kutrib
:
Gaining Power by Input Operations: Finite Automata and Beyond. CIAA 2011: 16-29 - Markus Holzer
, Martin Kutrib
, Katja Meckel:
Nondeterministic State Complexity of Star-Free Languages. CIAA 2011: 178-189 - Oscar H. Ibarra:
On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs. CIAA 2011: 190-202 - Artur Jez
, Andreas Maletti:
Computing All ℓ-Cover Automata Fast. CIAA 2011: 203-214 - Natalia Kushik
, Khaled El-Fakih, Nina Yevtushenko:
Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines. CIAA 2011: 215-224 - Violetta Lonati
, Matteo Pradella
:
Towards More Expressive 2D Deterministic Automata. CIAA 2011: 225-237 - Pavel Martyugin:
Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata. CIAA 2011: 238-249 - James Jerson Ortiz, Axel Legay, Pierre-Yves Schobbens
:
Distributed Event Clock Automata - Extended Abstract. CIAA 2011: 250-263 - Vesna Pajic, Gordana Pavlovic-Lazetic, Milos Pajic:
Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach. CIAA 2011: 282-289 - Evgeny Skvortsov, Evgeny Tipikin:
Experimental Study of the Shortest Reset Word of Random Automata. CIAA 2011: 290-298 - Sheng Yu:
Derick Wood: Always in Our Hearts. CIAA 2011: 1-2 - Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel:
Implementation and Application of Automata - 16th International Conference, CIAA 2011, Blois, France, July 13-16, 2011. Proceedings. Lecture Notes in Computer Science 6807, Springer 2011, ISBN 978-3-642-22255-9 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-01 11:20 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