doi
10.1007/bf01691346
regularity theory
important concepts
problem
automata theory
decision problem
articles
Many of the important concepts and results of conventional finite automata theory are developed for a generalization in which finite algebras take the place of finite automata. The standard closure theorems are proved for the class of sets “recognizable” by finite algebras, and a generalization of Kleene's regularity theory is presented. The theorems of the generalized theory are then applied to obtain a positive solution to a decision problem of second-order logic.
en
applications
class
finite algebras
conventional finite automata theory
Kleene's regularity theory
finite automata
algebra
solution
second-order logic
theory
class of sets
generalized theory
positive solutions
generalization
1968-03-01
results
article
automata
logic
theorem
https://doi.org/10.1007/bf01691346
1968-03
Generalized finite automata theory with an application to a decision problem of second-order logic
standard closure theorems
closure theorem
2021-12-01T19:52
https://scigraph.springernature.com/explorer/license/
concept
set
finite automata theory
place
false
57-81
J. W.
Thatcher
Springer Nature - SN SciGraph project
pub.1038809008
dimensions_id
1
2
Pure Mathematics
Mathematical Sciences
IBM Watson Research Center, USA
IBM Watson Research Center, USA
Theory of Computing Systems
1432-4350
Springer Nature
1433-0490
Wright
J. B.