scientific article; zbMATH DE number 7584599

MaRDI QIDQ5867520

Szilárd Zsolt Fazekas, Olivia Wu, Robert Mercaş

Publication date: 14 September 2022

Full work available at URL: http://www.jalc.de/issues/2022/issue_27_1-3/jalc-2022-131-149.php

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

zbMATH Keywords

complexityfinite automatanon-contiguous processingone-way jumping automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Jump complexity of finite automata with translucent letters ⋮ Sweep complexity revisited ⋮ On the Degree of Extension of Some Models Defining Non-Regular Languages ⋮ Freezing 1-Tag Systems with States

Cites Work

• Nondeterministic right one-way jumping finite automata
• Two-way deterministic automata with jumping mode
• Jumping Finite Automata: Characterizations and Complexity
• JUMPING FINITE AUTOMATA
• Queue Automata: Foundations and Developments
• Two-dimensional jumping finite automata
• One-Way Jumping Finite Automata
• Decidability of Right One-Way Jumping Finite Automata
• Properties of right one-way jumping finite automata

This page was built for publication: