The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable.
Karel Culík IIJuhani KarhumäkiPublished in: Theor. Comput. Sci. (1986)
Keyphrases
- expressive power
- guarded fragment
- finite automata
- datalog programs
- valued logic
- first order logic
- query containment
- grammatical inference
- function symbols
- language independent
- finite state automata
- regular path queries
- transitive closure
- cross lingual
- linear separability
- target language
- language identification
- data complexity
- logic programs
- closure properties
- function free horn
- databases
- monadic datalog
- inference rules
- regular expressions
- query language