On structural unambiguity of formal languages
A note on -rules in context-free grammars
On a classification of context-free languages
On star height hierarchies of context-free languages
Induction in formal languages. Some properties of reducing transformations and of isolable sets
Isolable and weakly isolable sets
Structural unambiguity of ALGOL MOD
Grammatical levels and subgrammars of context-free grammars
On sets generated by context-free grammars
Correction to: “On star height hierarchies of context-free languages”
On the size of context-free grammars
Recenzie
Two Operations with Formal Languages and their Influence upon Structural Unambiguity
Algoritmy 11. GAUSSpas. Riešenie systémov lineárnych algebraických rovníc s pásovými maticami. 12. GAUSSpassym
On the state complexity of semi-quantum finite automata
Some of the most interesting and important results concerning quantum finite automata are those showing that they can recognize certain languages with (much) less resources than corresponding classical finite automata. This paper shows three results of such a type that are stronger in some sense than other ones because (a) they deal with models of quantum finite automata with very little quantumness (so-called semi-quantum one- and two-way finite automata); (b) differences, even comparing with probabilistic...
Different time solutions for the firing squad synchronization problem on basic grid networks
We present several solutions to the Firing Squad Synchronization Problem on grid networks of different shapes. The nodes are finite state processors that work in unison with other processors and in synchronized discrete steps. The networks we deal with are: the line, the ring and the square. For all of these models we consider one- and two-way communication modes and we also constrain the quantity of information that adjacent processors can exchange at each step. We first present synchronization...
Page 1