Author of the publication

On Lexicalized Well-Behaved Restarting Automata That Are Monotone.

, , and . Developments in Language Theory, volume 6224 of Lecture Notes in Computer Science, page 352-363. Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

(In)Dependencies in Functional Generative Description by Restarting Automata., , and . NCMA, volume 263 of books@ocg.at, page 155-170. Austrian Computer Society, (2010)Clearing Restarting Automata., and . NCMA, volume 256 of books@ocg.at, page 77-90. Austrian Computer Society, (2009)On special forms of restarting automata., , and . Where Mathematics, Computer Science, Linguistics and Biology Meet, page 149-160. Kluwer Academic Publishers, (2001)A Measure for the Degree of Nondeterminism of Context-Free Languages., , and . CIAA, volume 4783 of Lecture Notes in Computer Science, page 192-202. Springer, (2007)A Taxonomy of Forgetting Automata., , and . MFCS, volume 711 of Lecture Notes in Computer Science, page 527-536. Springer, (1993)Restarting Automata with Structured Output and Functional Generative Description., , and . LATA, volume 6031 of Lecture Notes in Computer Science, page 500-511. Springer, (2010)Two-Dimensional Pattern Matching Against Basic Picture Languages., , and . CIAA, volume 11601 of Lecture Notes in Computer Science, page 209-221. Springer, (2019)Two-dimensional limited context restarting automata., and . NCMA, volume 304 of books@ocg.at, page 147-162. Österreichische Computer Gesellschaft, (2014)Hierarchies of weakly monotone restarting automata., and . RAIRO Theor. Informatics Appl., 39 (2): 325-342 (2005)The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages., , and . Theor. Comput. Sci., 410 (37): 3530-3538 (2009)