9 research outputs found
On the structure of context-sensitive grammars
Context sensitive grammar and generation of noncontext free language
On the Degree of Extension of Some Models Defining Non-Regular Languages
This work is a survey of the main results reported for the degree of
extension of two models defining non-regular languages, namely the context-free
grammar and the extended automaton over groups. More precisely, we recall the
main results regarding the degree on non-regularity of a context-free grammar
as well as the degree of extension of finite automata over groups. Finally, we
consider a similar measure for the finite automata with translucent letters and
present some preliminary results. This measure could be considered for many
mechanisms that extend a less expressive one.Comment: In Proceedings AFL 2023, arXiv:2309.0112
Regulated Formal Models and Their Reduction
Department of Theoretical Computer Science and Mathematical LogicKatedra teoretické informatiky a matematické logikyFaculty of Mathematics and PhysicsMatematicko-fyzikální fakult