Properties of right one-way jumping finite automata

DOI10.1016/j.tcs.2019.03.044zbMath1433.68193OpenAlexW2932707240MaRDI QIDQ5919708

Simon Beier, Markus Holzer

Publication date: 7 November 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://geb.uni-giessen.de/geb/volltexte/2018/13516/

zbMATH Keywords

closure propertiesjumping finite automataMyhill-Nerode relationpermutation-closed languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Two-way deterministic automata with jumping mode ⋮ Unnamed Item ⋮ The effect of jumping modes on various automata models ⋮ Non-returning deterministic and nondeterministic finite automata with translucent letters ⋮ A survey on automata with translucent letters ⋮ Sweep complexity revisited ⋮ Nondeterministic right one-way jumping finite automata

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• On input-revolving deterministic and nondeterministic finite automata
• Characterization and complexity results on jumping finite automata
• Operational state complexity and decidability of jumping finite automata
• Jumping Finite Automata: Characterizations and Complexity
• On Basic Properties of Jumping Finite Automata
• JUMPING FINITE AUTOMATA
• Regulated Grammars and Automata
• Bounded Algol-Like Languages
• On Context-Free Languages
• An Infinite Hierarchy of Context-Free Languages
• One-Way Jumping Finite Automata

This page was built for publication: Properties of right one-way jumping finite automata