Jumping automata over Infinite words

DOI10.1007/978-3-031-33264-7_2arXiv2304.01278MaRDI QIDQ6088920

Shaull Almagor, Omer Yizhaq

Publication date: 16 November 2023

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2304.01278

zbMATH Keywords

infinite wordsParikh imagejumping automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization and complexity results on jumping finite automata
• Two-way deterministic automata with jumping mode
• BOUNDED PARIKH AUTOMATA
• Jumping Finite Automata: Characterizations and Complexity
• Automata Theory and Model Checking
• The taming of the semi-linear set
• On Basic Properties of Jumping Finite Automata
• Affine Parikh automata
• JUMPING FINITE AUTOMATA
• Operational State Complexity under Parikh Equivalence
• On Context-Free Languages
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: Jumping automata over Infinite words