Monotonicity on Restarting Automata
暂无分享,去创建一个
Frantisek Mráz | Martin Plátek | Petr Jancar | Jörg Vogel | Martin Plátek | P. Jančar | F. Mráz | Jörg Vogel
[1] Frantisek Mráz,et al. On Monotonic Automata with a Restart Operation , 1999, J. Autom. Lang. Comb..
[2] Friedrich Otto,et al. Further Results on Restarting Automata , 2000, Words, Languages & Combinatorics.
[3] Friedrich Otto,et al. Growing Context-Sensitive Languages and Church-Rosser Languages , 1995, STACS.
[4] Frantisek Mráz,et al. On Restarting Automata with Rewriting , 1997, New Trends in Formal Languages.
[5] Markéta Stranáková. Selected Types of Pg-Ambiguity: Processing Based on Analysis by Reduction , 2000, TSD.
[6] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .
[7] Friedrich Otto,et al. Restarting automata, Church-Rosser languages, and representations of r.e. languages , 1999, Developments in Language Theory.
[8] Frantisek Mráz,et al. Different Types of Monotonicity for Restarting Automata , 1998, FSTTCS.
[9] Martin Plátek. Strict Monotonicity and Restarting Automata , 1999, Prague Bull. Math. Linguistics.
[10] Friedrich Otto,et al. Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages , 2004, J. Autom. Lang. Comb..
[11] Martin Plátek,et al. A Grammar Based Approach To A Grammar Checking Of Free Word Order Languages , 1994, COLING.
[12] Frantisek Mráz,et al. Deleting Automata with a Restart Operation , 1997, Developments in Language Theory.
[13] Géraud Sénizergues. A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences , 1990, Theor. Comput. Sci..
[14] Gheorghe Paun,et al. Marcus Contextual Grammars , 1994, Bull. EATCS.