scientific article; zbMATH DE number 1394484
From MaRDI portal
Publication:4934755
zbMath0942.68064MaRDI QIDQ4934755
Martin Plátek, Jörg Vogel, František Mráz, Petr Jančar
Publication date: 30 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (33)
Regulated variants of limited context restarting automata ⋮ Weighted restarting automata and pushdown relations ⋮ Sorted dependency insertion grammars ⋮ The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages ⋮ On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata ⋮ Restarting automata with restricted utilization of auxiliary symbols ⋮ Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata ⋮ Degrees of non-monotonicity for restarting automata ⋮ Left-to-right regular languages and two-way restarting automata ⋮ Weighted Restarting Automata and Pushdown Relations ⋮ Unnamed Item ⋮ A Measure for the Degree of Nondeterminism of Context-Free Languages ⋮ One-Way Restarting Automata and Their Sensitivitys ⋮ A hierarchy of jumping restarting automata ⋮ A survey on automata with translucent letters ⋮ A hierarchy of monotone deterministic non-forgetting restarting automata ⋮ Some classes of rational functions for pictures ⋮ Unnamed Item ⋮ On the complexity of 2-monotone restarting automata ⋮ Restarting transducers, regular languages, and rational relations ⋮ Succinct description of regular languages by weak restarting automata ⋮ A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* ⋮ Languages Accepted by Weighted Restarting Automata* ⋮ Hierarchies of weakly monotone restarting automata ⋮ Sequential monotonicity for restarting automata ⋮ On Restarting Automata with Window Size One ⋮ Weighted restarting automata ⋮ Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata ⋮ On Ordered RRWW-Automata ⋮ Weighted Restarting Automata as Language Acceptors ⋮ Context-free languages can be accepted with absolutely no space overhead ⋮ Lambda-confluence for context rewriting systems ⋮ On restarting automata with auxiliary symbols and small window size
This page was built for publication:
