Generalized regular expressions - a language for synthesis of programs with branching in loops

DOI10.1016/0304-3975(86)90029-0zbMath0617.68076OpenAlexW1977743816MaRDI QIDQ1822523

A. Brazma, E. B. Kinber

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90029-0

zbMATH Keywords

automataequivalence problemgeneralized regular expressionsinductive synthesis of programs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

Inductive synthesis of dot expressions ⋮ Some models of inductive syntactical synthesis from sample computations ⋮ Inductive synthesis of term rewriting systems ⋮ On complete sets of samples for generalized regular expressions ⋮ Algorithms for learning regular expressions from positive data

Cites Work

• Unnamed Item
• A class of functions synthesized from a finite number of examples and a lisp program scheme
• A Methodology for LISP Program Construction from Examples
• Constructing Programs from Example Computations
• Inductive synthesis of dot expressions

This page was built for publication: Generalized regular expressions - a language for synthesis of programs with branching in loops