Add to ORKGThis thesis is researching parsing based on matrix grammars. Introduces automata controled parsing method. It discusses problems of deterministic parsing of matrix grammars. Thesis is focusing on deterministic parsing of non-deterministic languages. It studies strength of this deterministic method
This bachelor thesis is dealing with translation based on coupled finite automaton. Coupled finite a...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focus...
The thesis introduces new models for formal languages, the m-limited state grammar and the deep pu...
This work deals with the design, applicability and the implementation of parsing methods based on pu...
This thesis studies regulated grammars, their fundamentals and expressing power regarding Chomsky hi...
This thesis is researching methods of parsing based on programmed grammars. It modifies known algori...
This work describes the characteristics of state grammars and n-limited state grammars with a focus ...
The subject of this thesis is to develop a method of syntactic analysis based on matrix grammar s. I...
This thesis deals with formal and syntax directed translation. This thesis contains theoretical part...
This work deals with advanced models of context-free grammars and explores the possibilities of adap...
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The...
The matrix grammar is a well-known concept of a grammar with restricted use of productions. By weake...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This bachelor thesis is dealing with translation based on coupled finite automaton. Coupled finite a...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focus...
The thesis introduces new models for formal languages, the m-limited state grammar and the deep pu...
This work deals with the design, applicability and the implementation of parsing methods based on pu...
This thesis studies regulated grammars, their fundamentals and expressing power regarding Chomsky hi...
This thesis is researching methods of parsing based on programmed grammars. It modifies known algori...
This work describes the characteristics of state grammars and n-limited state grammars with a focus ...
The subject of this thesis is to develop a method of syntactic analysis based on matrix grammar s. I...
This thesis deals with formal and syntax directed translation. This thesis contains theoretical part...
This work deals with advanced models of context-free grammars and explores the possibilities of adap...
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The...
The matrix grammar is a well-known concept of a grammar with restricted use of productions. By weake...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This bachelor thesis is dealing with translation based on coupled finite automaton. Coupled finite a...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...
This thesis deals with reducing automata, their normalization, and their application for a (robust) ...