scientific article; zbMATH DE number 7444000

zbMath1483.68155arXiv1708.06460MaRDI QIDQ5016357

Martin Kutrib, Simon Beier, Markus Holzer

Publication date: 13 December 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Jumping automata over Infinite words ⋮ Operational State Complexity and Decidability of Jumping Finite Automata ⋮ Closure properties of knapsack semilinear groups ⋮ Operational Accepting State Complexity: The Unary and Finite Case

Cites Work

• Unnamed Item
• Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
• Operational state complexity and decidability of jumping finite automata
• A Bound on Solutions of Linear Integer Equalities and Inequalities
• The taming of the semi-linear set
• JUMPING FINITE AUTOMATA
• Operational State Complexity under Parikh Equivalence
• Bounded Algol-Like Languages
• Finite-Turn Pushdown Automata
• On Context-Free Languages

This page was built for publication: