Automaton representation of linear conjunctive languages

DOI10.1007/3-540-45005-X_35MaRDI QIDQ4412133zbMATH OpenFDO

Authors Alexander Okhotin

Publication date 13 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2450/24500393.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Recommendations

• On the equivalence of linear conjunctive grammars and trellis automata
• EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES
• scientific article; zbMATH DE number 2201371
• Efficient automaton-based recognition for linear conjunctive languages
• The hardest linear conjunctive language

Cited in

(11)

• The hardest linear conjunctive language
• Deterministic biautomata and subclasses of deterministic linear languages
• Recognition of poly-slender context-free languages by trellis automata
• Kernels of sub-classes of context-free languages
• scientific article; zbMATH DE number 3577162 (Why is no real title available?)
• Efficient automaton-based recognition for linear conjunctive languages
• Domain mu-calculus
• On the equivalence of linear conjunctive grammars and trellis automata
• EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES
• Kernels of context-free languages
• The Boolean closure of linear context-free languages

This page was built for publication: Automaton representation of linear conjunctive languages

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