Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Implementation and Application of Automata: 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009, Proceedings > Short Regular Expressions from Finite Automata: Empirical Results
Implementation and Application of Automata: 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009, Proceedings |
Sebastian Maneth
Springer Berlin Heidelberg
Implementation and Application of Automata: 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009, Proceedings
Short Regular Expressions from Finite Automata: Empirical Results
Authors

Hermann Gruber; Markus Holzer; Michael Tautschnig

ARI Id

1664777918699_3179412

Access

Not Available Free

Pages

188-197

DOI

10.1007/978-3-642-02979-0_22

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-02979-0_22

Table of Contents of Book
Showing 1 to 20 of 34 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Implementation and Application of Automata in String Processing
Gonzalo Navarro
1-1
Applications of Automata in XML Processing
Christoph Koch
2-2
Program Analysis through Finite Tree Automata
Helmut Seidl
3-3
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
Markus Holzer; Andreas Maletti
4-13
On Extremal Cases of Hopcroft’s Algorithm
Giusi Castiglione; Antonio Restivo; Marinella Sciortino
14-23
Compact Normal Form for Regular Languages as Xor Automata
Jean Vuillemin; Nicolas Gama
24-33
Cellular Automata with Sparse Communication
Martin Kutrib; Andreas Malcher
34-43
A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule
Adam Clarridge; Kai Salomaa
44-53
On Parallel Implementations of Deterministic Finite Automata
Jan Holub; Stanislav Štekr
54-64
FAdo and GUItar: Tools for Automata Manipulation and Visualization
André Almeida; Marco Almeida; José Alves; Nelma Moreira; Rogério Reis
65-74
A Testing Framework for Finite-State Morphology
François Barthélemy
75-83
A Table Compression Method for Extended Aho-Corasick Automaton
Yanbing Liu; Yifu Yang; Ping Liu; Jianlong Tan
84-93
Compact Representation for Answer Sets of n-ary Regular Queries
Kazuhiro Inaba; Haruo Hosoya
94-104
Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
Akio Fujiyoshi
105-114
Random Generation of Deterministic Tree (Walking) Automata
Pierre-Cyrille Héam; Cyril Nicaud; Sylvain Schmitz
115-124
Hedge Pattern Partial Derivative
Taro Suzuki; Satoshi Okui
125-134
TAGED Approximations for Temporal Properties Model-Checking
Roméo Courbis; Pierre-Cyrille Héam; Olga Kouchnarenko
135-144
Verifying Parallel Programs with Dynamic Communication Structures
Mohamed Faouzi Atig; Tayssir Touili
145-154
Fixpoint Guided Abstraction Refinement for Alternating Automata
Pierre Ganty; Nicolas Maquet; Jean-François Raskin
155-164
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 34 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings