Langages sur des alphabets infinis

DOI10.1016/0166-218X(80)90050-5zbMath0443.68058MaRDI QIDQ1144383

Joffroy Beauquier, Jean-Michel Autebert, Luc Boasson

Publication date: 1980

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

closure propertiescontext-free languages over infinite alphabets

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Set augmented finite automata over infinite alphabets, An algebraic approach to data languages and timed languages, A Theory of Formal Choreographic Languages, Formes de langages et de grammaires, An algebraic characterization of deterministic regular languages over infinite alphabets., Untiming timed languages, CLASS COUNTING AUTOMATA ON DATAWORDS, Counting Multiplicity over Infinite Alphabets, Rational languages defined with a non-associative concatenation, Finitary and infinitary interpretations of languages, Classes of regular and context-free languages over countably infinite alphabets

Cites Work

• Formes de langages et de grammaires
• Adherences of languages
• Context-free grammar forms
• Control sets on context-free grammar forms
• Program schemes, recursion schemes, and formal languages
• The Hardest Context-Free Language
• On Context-Free Languages
• A representation theorem for algebraic and context-free power series in noncommuting variables
• A helpful result for proving inherent ambiguity
• Chains of full AFL's
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item