54 citations · 213 across the 36 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.FL2009★ 3 cited
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement
Tomáš Masopust, Alexander Meduna
Recently, it has been shown that every recursively enumerable language can be generated by a scattered context grammar with no more than three nonterminals. However, in that constr…
cs.FL2009
Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata"
Tomas Masopust
This paper gives answers to questions formulated as open in the paper "On State Observability in Deterministic Finite Automata" by A. Mateescu and Gh. Paun. Specifically, it demons…