Pages that link to "Item:Q4923281"
From MaRDI portal
The following pages link to CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES (Q4923281):
Displaying 17 items.
- The effect of end-markers on counter machines and commutativity (Q265080) (← links)
- On bounded languages and reversal-bounded automata (Q899318) (← links)
- On store languages of language acceptors (Q1786598) (← links)
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (Q1998865) (← links)
- Finitely distinguishable erasing pattern languages (Q2290682) (← links)
- On the overlap assembly of strings and languages (Q2311303) (← links)
- On families of full trios containing counter machine languages (Q2333810) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- Deletion operations on deterministic families of automata (Q2407104) (← links)
- On store languages and applications (Q2417850) (← links)
- On counting functions and slenderness of languages (Q2422037) (← links)
- On Families of Full Trios Containing Counter Machine Languages (Q2817390) (← links)
- Descriptional Complexity of Bounded Regular Languages (Q2829978) (← links)
- On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L (Q2830214) (← links)
- On the Density of Context-Free and Counter Languages (Q4640039) (← links)
- On the Boundedness Property of Semilinear Sets (Q4922123) (← links)
- Input-Position-Restricted Models of Language Acceptors (Q5112180) (← links)
