Two-way machines and de Bruijn words
From MaRDI portal
Publication:6199880
Cites work
- scientific article; zbMATH DE number 3936519 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1502111 (Why is no real title available?)
- scientific article; zbMATH DE number 7354705 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- A framework for constructing de Bruijn sequences via simple successor rules
- A generalization of context-free determinism
- A surprisingly simple de Bruijn sequence construction
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
- Fast Pattern Matching in Strings
- Intersection and union of regular languages and state complexity
- Lexicographically least circular substrings
- Limited automata and regular languages
- Limited automata and unary languages
- Limited automata: properties, complexity and variants
- Nondeterminism and the size of two way finite automata
- Simulating finite automata with context-free grammars.
- Tight lower bounds on the length of word chains
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
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)