Jumping automata over infinite words

DOI10.1007/S00224-024-10192-WMaRDI QIDQ6661761

Shaull Almagor, Omer Yizhaq

Publication date: 13 January 2025

Published in: Theory of Computing Systems (Search for Journal in Brave)

zbMATH Keywords

infinite wordsParikh imagejumping automata

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Theory of computing (68Qxx) General logic (03Bxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization and complexity results on jumping finite automata
• Two-way deterministic automata with jumping mode
• Bounded Parikh automata
• Jumping Finite Automata: Characterizations and Complexity
• Integer Programming with a Fixed Number of Variables
• 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
• Complexity of Problems of Commutative Grammars
• Operational State Complexity under Parikh Equivalence
• Bounded Algol-Like Languages
• On Context-Free Languages
• Testing and generating infinite sequences by a finite automaton
• Parikh automata over Infinite words

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661761)