6533b7d8fe1ef96bd126a1fe

RESEARCH PRODUCT

Deterministic generalized automata

Rosa MontalbanoDora Giammarresi

subject

Discrete mathematicsDeterministic automatonTimed automatonQuantum finite automataBüchi automatonTwo-way deterministic finite automatonNondeterministic finite automatonω-automatonNonlinear Sciences::Cellular Automata and Lattice GasesComputer Science::Formal Languages and Automata TheoryMobile automatonMathematics

description

A generalized automaton (GA) is a finite automaton where the single transitions are defined on words rather than on single letters. Generalized automata were considered by K. Hashiguchi who proved that the problem of calculating the size of a minimal GA is decidable.

yearjournalcountryeditionlanguage
1995-01-01
https://doi.org/10.1007/3-540-59042-0_84