Name
Abstract | ||
|---|---|---|
Recently, new types of non-sequential machine models have been introduced and studied, such as jumping automata and one-way jumping automata. We study the abilities and limitations of automata with these two jumping modes of tape heads with respect to how they affect the class of accepted languages. We give several methods to determine whether a language is accepted by a machine with jumping mode. We also consider relationships among the classes of languages defined by the new machines and their classical counterparts. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-20981-0_5 | Automata |
Field | DocType | Citations |
Context-free language,Jumping,Computer science,Automaton,Theoretical computer science,Machine models,Pushdown automaton,Pumping lemma for regular languages | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Szilárd Zsolt Fazekas | 1 | 14 | 7.40 |
| Kaito Hoshi | 2 | 0 | 0.34 |
| Akihiro Yamamura | 3 | 96 | 13.29 |