On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages
Danilo BruschiGiovanni PighizziniNicoletta SabadiniPublished in: Inf. Comput. (1994)
Keyphrases
- regular languages
- context free
- grammatical inference
- finite automata
- regular expressions
- formal language theory
- regular tree languages
- finite state automata
- finite state
- context sensitive
- decision problems
- context dependent
- language independent
- expressive power
- cellular automata
- positive data
- complementarity problems
- formal languages
- tree automata
- multi lingual
- probabilistic automata
- tree languages
- pattern matching
- language identification
- finite state machines
- query language
- information retrieval
- execution traces
- np complete
- target language
- minimum cost