Prolog infinite trees and automata

DOI10.1051/ita/1991250503971zbMath0764.68087OpenAlexW122767979MaRDI QIDQ3991295

Solange Coupet-Grimal

Publication date: 28 June 1992

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92398

zbMATH Keywords

Prologinfinite treesregular expressionlanguage defined by a rational expressionminimal deterministic finite state automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• Fundamental properties of infinite trees
• Parser generation and grammar manipulation using prolog's infinite trees
• Programming Techniques: Regular expression search algorithm
• The theory of languages
• Derivatives of Regular Expressions

This page was built for publication: Prolog infinite trees and automata