Two-way machines and de Bruijn words
From MaRDI portal
Publication:6199880
DOI10.1007/978-3-031-40247-0_19OpenAlexW4385701090MaRDI QIDQ6199880FDOQ6199880
Authors: Giovanni Pighizzini, Luca Prigioniero 
Publication date: 28 February 2024
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-40247-0_19
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Pattern Matching in Strings
- Title not available (Why is that?)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
- Lexicographically least circular substrings
- Intersection and union of regular languages and state complexity
- Nondeterminism and the size of two way finite automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- A surprisingly simple de Bruijn sequence construction
- Simulating finite automata with context-free grammars.
- Tight lower bounds on the length of word chains
- A generalization of context-free determinism
- A framework for constructing de Bruijn sequences via simple successor rules
- Limited automata: properties, complexity and variants
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
- Limited automata and unary languages
- Limited automata and regular languages
Cited In (1)
This page was built for publication: Two-way machines and de Bruijn words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199880)
