A linear-time simulation of deterministic d-limited automata
From MaRDI portal
Publication:832958
DOI10.1007/978-3-030-81508-0_28OpenAlexW3188431180MaRDI QIDQ832958FDOQ832958
Authors: Alexander A. Rubtsov 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_28
Cites Work
- Title not available (Why is that?)
- General context-free recognition in less than cubic time
- Fast context-free grammar parsing requires fast Boolean matrix multiplication
- Title not available (Why is that?)
- A Second Course in Formal Languages and Automata Theory
- On the translation of languages from left to right
- Parsing algorithms with backtrack
- Parsing expression grammars: a recognition-based syntactic foundation
- Theory of one-tape linear-time Turing machines
- Title not available (Why is that?)
- One-tape, off-line Turing machine computations
- Concatenation of inputs in a two-way automaton
- A generalization of context-free determinism
- Limited automata: properties, complexity and variants
- Limited automata and context-free languages
- Regular Closure of Deterministic Languages
- If the current clique algorithms are optimal, so is Valiant's parser
- Simulation of two-way pushdown automata revisited
- Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!
- The computational power of parsing expression grammars
- Linear-time limited automata
Cited In (1)
This page was built for publication: A linear-time simulation of deterministic \(d\)-limited automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832958)
