Notes on dual concatenation

DOI10.1142/S0129054107005406MaRDI QIDQ3401485zbMATH OpenFDO

Authors Alexander Okhotin

Publication date 29 January 2010

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054107005406

zbMATH Keywords

concatenationconjunctive grammarslanguage equations

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Mathematical Foundations of Computer Science 2004
• The dual of concatenation
• Formal languages over GF(2)
• Orthogonal concatenation: language equations and state complexity
• Concatenation of regular languages and descriptional complexity

Cites work

• Boolean grammars
• Decidability of trajectory-based equations
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Nondeterminism and Boolean operations in pda's
• On language equations with invertible operations
• On the equivalence of linear conjunctive grammars and trellis automata
• Operations and language generating devices suggested by the genome evolution
• Shuffle on trajectories: Syntactic constraints
• The dual of concatenation

Cited in

(3)

• The dual of concatenation
• Mathematical Foundations of Computer Science 2004
• Expressive power of \(\text{LL}(k)\) Boolean grammars

This page was built for publication: Notes on dual concatenation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401485)