On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone-Reference-Cited by-同舟云学术

On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone

Published:2006 Issue: Volume: Page:247-258
ISSN:0302-9743
Container-title:Computer Science – Theory and Applications
language:
Short-container-title:

Author:

Messerschmidt Hartmut,Otto Friedrich

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11753728_26.pdf

Reference13 articles.

1. Lecture Notes in Computer Science;B. Braunmühl von,1979

2. Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Information and Computation 141, 1–36 (1998)

3. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

4. Lecture Notes in Computer Science;P. Jančar,1995

5. Jančar, P., Mráz, F., Plátek, M., Vogel, J.: On monotonic automata with a restart operation. J. Automata, Languages and Combinatorics 4, 287–311 (1999)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Weighted Restarting Automata as Language Acceptors;Implementation and Application of Automata;2016

2. On Restarting Automata with Window Size One;Descriptional Complexity of Formal Systems;2011

3. CD-Systems of Restarting Automata Governed by Explicit Enable and Disable Conditions;SOFSEM 2010: Theory and Practice of Computer Science;2010

4. A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata;Theory of Computing Systems;2009-11-21

5. Left-to-right regular languages and two-way restarting automata;RAIRO - Theoretical Informatics and Applications;2009-04-24