On the properties of language classes defined by bounded reaction automata.
Fumiya OkuboSatoshi KobayashiTakashi YokomoriPublished in: Theor. Comput. Sci. (2012)
Keyphrases
- complexity of query evaluation
- data complexity
- closure properties
- algebraic operations
- regular languages
- query evaluation
- tree automata
- formal language
- algebraic structures
- cellular automata
- language learning
- context free
- structural properties
- finite state
- precisely defined
- formal languages
- grammatical inference
- data sets
- finite state automaton
- formal language theory
- desirable properties
- relational algebra
- regular expressions
- programming language
- natural language
- genetic algorithm
- knowledge base
- approximation operators
- finite automata
- specification language
- language processing
- finite state machines
- query answering