On Special Forms of Restarting Automata

František Mráz (), Martin Plátek () and Martin Procházka
Additional contact information
František Mráz: Charles University, Department of Computer Science
Martin Plátek: Charles University, Department of Computer Science
Martin Procházka: Charles University, Department of Computer Science

Chapter Chapter 13 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 149-160 from Springer

Abstract: Abstract We study transformations of automata from some (sub)classes of restarting automata (RRWW-automata) into two types of special forms. We stress particularly the transformations into the linguistically motivated weak cyclic form. Special forms of the second type express a certain degree of determinism of such automata.

Keywords: Special Form; Mathematical Linguistics; Simple Sentence; Input Word; Simulated Phase (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_13

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_13

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().