Boolean language operations on nondeterministic automata with a pushdown of constant height.
Zuzana BednárováViliam GeffertCarlo MereghettiBeatrice PalanoPublished in: J. Comput. Syst. Sci. (2017)
Keyphrases
- finite state
- finite automata
- model checking
- programming language
- regular languages
- natural language
- formal language theory
- language learning
- formal languages
- finite state machines
- finite automaton
- regular expressions
- finite state automaton
- cellular automata
- turing machine
- language constructs
- algebraic operations
- boolean queries
- information retrieval
- boolean functions
- artificial intelligence
- genetic algorithm
- uniform distribution
- multi valued
- specification language
- context free
- real valued
- tree automata
- markov decision processes
- markov chain
- object oriented
- data model
- reinforcement learning
- database query languages
- neural network