Succinct description of regular languages by weak restarting automata
From MaRDI portal
Publication:948085
DOI10.1016/J.IC.2008.03.016zbMATH Open1154.68072OpenAlexW2023450059MaRDI QIDQ948085FDOQ948085
Authors: Martin Kutrib, Jens Reimann 
Publication date: 8 October 2008
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.016
Recommendations
- OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA
- On the descriptional complexity of deterministic ordered restarting automata
- On the descriptional complexity of stateless deterministic ordered restarting automata
- Reversible Ordered Restarting Automata
- Non-recursive trade-offs for deterministic restarting automata
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Restarting automata
- Minimal NFA Problems are Hard
- Recent advances in formal languages and applications.
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
- A lower bound technique for the size of nondeterministic finite automata
- State complexity of some operations on binary regular languages
- State-complexity of finite-state devices, state compressibility and incompressibility
- Intersection and union of regular languages and state complexity
- Partial orders on words, minimal elements of regular languages, and state complexity
- Title not available (Why is that?)
- On the size of parsers and \(\text{LR}(k)\)-grammars
- Restarting automata, Church-Rosser languages, and representations of {r. e. \ }languages
- Size/lookahead tradeoff for \(LL(k)\)-grammars
Cited In (16)
- On Stateless Deterministic Restarting Automata
- On CD-systems of stateless deterministic two-phase RR(1)-automata
- OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA
- Title not available (Why is that?)
- On restarting automata with auxiliary symbols and small window size
- On restarting automata with window size one
- On stateless deterministic restarting automata
- Non-recursive trade-offs for deterministic restarting automata
- On the descriptional complexity of deterministic ordered restarting automata
- Restarting transducers, regular languages, and rational relations
- Title not available (Why is that?)
- On the descriptional complexity of the window size for deleting restarting automata
- Descriptional complexity of regular languages
- On the descriptional complexity of stateless deterministic ordered restarting automata
- On some decision problems for stateless deterministic ordered restarting automata
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata
This page was built for publication: Succinct description of regular languages by weak restarting automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948085)
