scientific article; zbMATH DE number 2040896
From MaRDI portal
Publication:4452052
zbMath1037.68088MaRDI QIDQ4452052
Publication date: 11 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2710/27100055.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
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 ⋮ A survey on automata with translucent letters ⋮ A hierarchy of monotone deterministic non-forgetting restarting automata ⋮ Restarting Tree Automata and Linear Context-Free Tree Languages ⋮ Unnamed Item ⋮ On the complexity of 2-monotone restarting automata ⋮ Succinct description of regular languages by weak restarting automata ⋮ On determinism versus nondeterminism for restarting automata ⋮ Decidability Questions for Insertion Systems and Related Models ⋮ A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* ⋮ Binding-blocking automata ⋮ Sequential monotonicity for restarting automata ⋮ Two-dimensional hierarchies of proper languages of lexicalized FRR-automata ⋮ Context-free languages can be accepted with absolutely no space overhead
Uses Software
This page was built for publication:
