scientific article; zbMATH DE number 7444013
From MaRDI portal
Publication:5016372
zbMATH Open1483.68180arXiv1708.06470MaRDI QIDQ5016372FDOQ5016372
Authors: Martin Plátek, Friedrich Otto 
Publication date: 13 December 2021
Full work available at URL: https://arxiv.org/abs/1708.06470
Title of this publication is not available (Why is that?)
Recommendations
- On h-lexicalized restarting list automata
- On lexicalized well-behaved restarting automata that are monotone
- scientific article; zbMATH DE number 2040896
- scientific article; zbMATH DE number 1836418
- On special forms of restarting automata
- Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata
- Restarting automata, Church-Rosser languages, and representations of {r. e. \ }languages
- On stateless deterministic restarting automata
- On Stateless Deterministic Restarting Automata
- Restarting Tree Automata and Linear Context-Free Tree Languages
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Restarting automata with auxiliary symbols restricted by lookahead size
- Recent advances in formal languages and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- SHRINKING RESTARTING AUTOMATA
- Monotonicity of restarting automata
- LR-regular grammars - an extension of LR(k) grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Left-to-right regular languages and two-way restarting automata
- Developments in Language Theory
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages
- Title not available (Why is that?)
- A characterization of two-way deterministic classes of languages
- On h-lexicalized restarting list automata
Cited In (7)
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages
- A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata
- Lexicalized syntactic analysis by two-way restarting automata
- On proper languages and transformations of lexicalized types of automata
- On lexicalized well-behaved restarting automata that are monotone
- On h-lexicalized restarting list automata
- One-Way Restarting Automata and Their Sensitivitys
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5016372)
