Familles de langages fermées par crochet ouvert
From MaRDI portal
Publication:598819
DOI10.1016/0304-3975(79)90038-0zbMath0413.68074OpenAlexW2081664553MaRDI QIDQ598819
Publication date: 1979
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(79)90038-0
formal languageschecking automata languagesderivation bounded context-free languageslanguage of the squaresoperation of open bracketsymmetric language
Related Items
On the intersection of the class of linear context-free languages and the class of single-reset languages ⋮ On the intersection of stacks and queues ⋮ Independance forte de certaines opérations ⋮ Compelled operations and operations of degreeP
Cites Work
- Syntactic operators on full semiAFLs
- Familles de langages translatables et fermées par crochet
- Transductions des langages de Chomsky
- Checking automata and one-way stack languages
- Principal AFL
- Finite-turn checking automata
- Sur diverses familles de langages fermées par transduction rationnelle
- On Relations Defined by Generalized Finite Automata
- Finite-Turn Pushdown Automata
- One-way stack automata
- An Infinite Hierarchy of Context-Free Languages
- Studies in abstract families of languages
- Chains of full AFL's
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item