The generalization of generalized automata: expression automata

Authors:
Yo-Sub Han;Derick Wood
Affiliations:
Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong;Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong
Venue:
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Year:
2004

Citing 7
Cited 9

Finite automata

Handbook of theoretical computer science (vol. B)
Deterministic generalized automata

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Theory of Computation: A Primer

Theory of Computation: A Primer
Factorizations of languages and commutativity conditions

Acta Cybernetica
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Prime decompositions of regular prefix codes

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata

On the existence of prime decompositions

Theoretical Computer Science
On an expansion of nondeterministic finite automata

Journal of Applied Mathematics and Computing
Length Codes, Products of Languages and Primality

Language and Automata Theory and Applications
Variants of codes and indecomposable languages

Information and Computation
Extended Nondeterministic Finite Automata

Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Multi-tape automata with symbol classes

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Prefix-Free regular-expression matching

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Prime decompositions of regular languages

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Shorter regular expressions from finite-state automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

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