Old Web
English
Sign In
Acemap
>
Paper
>
REPRESENTATION OF A REGULAR LANGUAGE BY MEANS OF A FINITEDETERMINISTIC AUTOMATON
REPRESENTATION OF A REGULAR LANGUAGE BY MEANS OF A FINITEDETERMINISTIC AUTOMATON
1978
Kyoichi Yoshinaga
Masahiro Nagamatsu
Keywords:
Büchi automaton
Probabilistic automaton
Timed automaton
Deterministic automaton
Two-way deterministic finite automaton
Nondeterministic finite automaton
Pushdown automaton
Algorithm
Discrete mathematics
Continuous automaton
Mathematics
Theoretical computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]