Compelled operations and operations of degreeP
From MaRDI portal
Publication:3890132
DOI10.1007/BF01744304zbMath0445.68060OpenAlexW2042255091MaRDI QIDQ3890132
No author found.
Publication date: 1980
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01744304
families of languageshierarchy theoremsbinary syntactic operatorscompelled operationsfull semi AFLsoperations of degree p
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Familles de langages fermées par crochet ouvert
- Syntactic operators on full semiAFLs
- Familles de langages translatables et fermées par crochet
- Uniformly erasable AFL
- Checking automata and one-way stack languages
- Derivation-bounded languages
- A remark about a substitution property
- Reversal-Bounded Acceptors and Intersections of Linear Languages
- Linear Languages and the Intersection Closures of Classes of Languages
- Finite-Turn Pushdown Automata
- On equal matrix languages
- An Infinite Hierarchy of Context-Free Languages
- Full AFLs and nested iterated substitution
- Quasi-realtime languages
- Chains of full AFL's
This page was built for publication: Compelled operations and operations of degreeP