We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Mini...
We study the pattern statistics representing the number of occurrences of a given string in a word of length n generated at random by rational stochastic models, defined by means ...
We introduce a weighted logic with discounting and we establish B¨uchi’s and Elgot’s theorem for weighted automata over finite words and arbitrary commutative semirings. The...
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...