Performing regular operations with 1-limited automata
From MaRDI portal
Publication:2164004
DOI10.1007/978-3-031-05578-2_19OpenAlexW4285245446MaRDI QIDQ2164004
Luca Prigioniero, Šimon Sádovský, Giovanni Pighizzini
Publication date: 11 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_19
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the state complexity of operations on two-way finite automata
- Succinct representation of regular languages by Boolean automata
- The state complexities of some basic operations on regular languages
- Limited automata: properties, complexity and variants
- Behavioral strengths and weaknesses of various models of limited automata
- Limited Automata and Context-Free Languages
- State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
- LIMITED AUTOMATA AND REGULAR LANGUAGES
- A generalization of context-free determinism
- Limited automata and unary languages
- Linear-time limited automata
This page was built for publication: Performing regular operations with 1-limited automata
