Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

WIA
2004
Springer

favoriteEmaildiscussreport

117views Artificial Intelligence» more WIA 2004»

The Generalization of Generalized Automata: Expression Automata

13 years 9 months ago

The Generalization of Generalized Automata: Expression Automata

Download cs.yonsei.ac.kr

Abstract. We explore expression automata with respect to determinism, minimization and primeness. We deﬁne determinism of expression automata using preﬁx-freeness. This approach is, to some extent, similar to that of Giammarresi and Montalbano’s deﬁnition of deterministic generalized automata. We prove that deterministic expression automata languages are a proper subfamily of the regular languages. We deﬁne the minimization of deterministic expression automata. Lastly, we discuss prime preﬁx-free regular languages. Note that we have omitted almost all proofs in this preliminary version.

Yo-Sub Han, Derick Wood

Real-time Traffic

Artificial Intelligence | Deterministic Expression Automata | Deterministic Generalized Automata | Expression Automata | WIA 2004 |

claim paper

Related Content

» A Generalization of Cobhams Theorem to Automata over Real Numbers

» Decidability and Complexity Results for Timed Automata and Semilinear Hybrid Automata

» Complementation of Rational Sets on Scattered Linear Orderings of Finite Rank

» Marrying Words and Trees

» Deterministic Automata on Unranked Trees

» Simulations between triangular and hexagonal numberconserving cellular automata

» MeanPayoff Automaton Expressions

» Timed IO Automata A Mathematical Framework for Modeling and Analyzing RealTime Systems

» A Decision Procedure for Bisimilarity of Generalized Regular Expressions

Post Info
More Details (n/a)

Added	03 Jul 2010
Updated	03 Jul 2010
Type	Conference
Year	2004
Where	WIA
Authors	Yo-Sub Han, Derick Wood

Comments (0)