The Unique Decipherability in the Monoid of Regular Languages is Undecidable.

Juhani Karhumäki Aleksi Saarela

Published in: Fundam. Informaticae (2011)

Keyphrases

regular languages
context free languages
regular expressions
grammatical inference
finite automata
decision problems
context free grammars
context free
pattern matching
positive data
pac learning
equivalence queries
statistical queries
objective function
finite state machines
sufficient conditions
query language