scientific article; zbMATH DE number 7584604

MaRDI QIDQ5867525

Šimon Sádovský, Giovanni Pighizzini, Luca Prigioniero

Publication date: 14 September 2022

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

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

zbMATH Keywords

regular languagesdescriptional complexitylimited automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Performing regular operations with 1-limited automata ⋮ Once-Marking and Always-Marking 1-Limited Automata

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Descriptional complexity of limited automata
• Limited automata: properties, complexity and variants
• Behavioral strengths and weaknesses of various models of limited automata
• Limited Automata and Context-Free Languages
• Reversible Limited Automata
• LIMITED AUTOMATA AND REGULAR LANGUAGES
• Nondeterminism and the size of two way finite automata
• A generalization of context-free determinism
• Limited automata and unary languages
• Linear-time limited automata

This page was built for publication: