On the complexity of membership and counting in height-deterministic pushdown automata
Journal of Automata, Languages and Combinatorics
Modularization of regular growth automata
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Test generation from recursive tiles systems
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
| Hi-index | 0.00 |
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consider the class of languages recognized by automata generated by all its synchronized grammars. The synchronization is an automaton-related notion: all grammars generating the same automaton synchronize the same languages. When the synchronizing automaton is unambiguous, the class of its synchronized languages forms an effective boolean algebra lying between the classes of regular languages and unambiguous context-free languages. We additionally provide sufficient conditions for such classes to be closed under concatenation and its iteration.