Result 1 to 20 of 96 total
An infinite hierarchy of language families resulting from stateless pushdown automata with limited pushdown alphabets. (English)
Kutrib, Martin (ed.) et al., Descriptional complexity of formal systems. 14th international workshop, DCFS 2012, Braga, Portugal, July 23‒25, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31622-7/pbk). Lecture Notes in Computer Science 7386, 236-243 (2012).
1
One-sided random context grammars with leftmost derivations. (English)
Bordihn, Henning (ed.) et al., Languages alive. Essays dedicated to Jürgen Dassow on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-31643-2/pbk). Lecture Notes in Computer Science 7300, 160-173 (2012).
2
Tree-controlled grammars with restrictions placed upon cuts and paths. (English)
Kybernetika 48, No. 1, 165-175 (2012).
3
Nonterminal complexity of one-sided random context grammars. (English)
Acta Inf. 49, No. 2, 55-68 (2012).
4
One-sided random context grammars. (English)
Acta Inf. 48, No. 3, 149-163 (2011).
5
Parsing based on $n$-path tree-controlled grammars. (English)
Theor. Appl. Inform. 23, No. 3-4, 213-228 (2011).
6
Scattered context grammars generating sentences followed by derivation trees. (English)
Theor. Appl. Inform. 23, No. 2, 97-106 (2011).
7
Workspace theorems for regular-controlled grammars. (English)
Theor. Comput. Sci. 412, No. 35, 4604-4612 (2011).
8
Design of a retargetable decompiler for a static platform-independent malware analysis (English)
ISA, 72-86 (2011).
9
On nondeterminism in programmed grammars (English)
AFL, 315-327 (2011).
10
N-accepting restricted pushdown automata systems (English)
AFL, 168-183 (2011).
11
Some power-decreasing derivation restrictions in grammar systems. (English)
Schedae Inform. 19, 23-34 (2010).
12
Left-forbidding cooperating distributed grammar systems. (English)
Theor. Comput. Sci. 411, No. 40-42, 3661-3667 (2010).
13
Multigenerative grammar systems and matrix grammars. (English)
Kybernetika 46, No. 1, 68-82 (2010).
14
Scattered context grammars and their applications. (English)
Southampton: WIT Press (ISBN 978-1-84564-426-0/hbk; 978-1-84564-427-7/ebook). ix, 199~p. \sterling~85.00 (2010).
15
Descriptional complexity of three-nonterminal scattered context grammars: an improvement. (English)
Comput. Res. Repos. 2009, Article No. 0907.5132 (2009).
16
On context-free rewriting with a simple restriction and its computational completeness. (English)
Rev. Inform. Teor. Apl. 43, No. 2, 365-378 (2009).
17
On pure multi-pushdown automata that perform complete pushdown pops. (English)
Acta Cybern. 19, No. 2, 537-552 (2009).
18
An infinite hierarchy of language families generated by scattered context grammars with $n$-limited derivations. (English)
Theor. Comput. Sci. 410, No. 21-23, 1961-1969 (2009).
19
On context-free rewriting with a simple restriction and its computational completeness. (English)
Theor. Inform. Appl. 43, No. 2, 365-378 (2009).
20
Result 1 to 20 of 96 total
Start
Contact
Print
General Help
