Regular-like tree expressions

DOI10.1007/BF00996800MaRDI QIDQ3659171zbMATH OpenFDO

Authors Antonio Barrero, Michael G. Thomason, Rafael C. Gonzalez

Publication date 1983

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00996800

zbMATH Keywords

context-free languagesexpansive tree grammarsregular expressionsregularity-preserving transformations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Algebra automata I: Parallel programming as a prolegomena to the categorical approach
• Generalized finite automata theory with an application to a decision problem of second-order logic
• scientific article; zbMATH DE number 3596271 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Syntactic Recognition of Imperfectly Specified Patterns
• Tree generating regular systems
• Tree Systems for Syntactic Pattern Recognition

This page was built for publication: Regular-like tree expressions

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