The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable.
Karel Culík IIJuhani KarhumäkiPublished in: MFCS (1986)
Keyphrases
- expressive power
- guarded fragment
- finite automata
- datalog programs
- valued logic
- grammatical inference
- function symbols
- query containment
- first order logic
- finite state automata
- transitive closure
- language independent
- finite number
- regular path queries
- databases
- text summarization
- finite state machines
- cross lingual
- query language
- closure properties
- linear separability
- target language
- equivalence relation
- query translation
- learning algorithm