Prolog infinite trees and automata
type: Item
instance of: scholarly article
title: Prolog infinite trees and automata
zbMATH Open document ID: 0764.68087
author: Solange Coupet-Grimal
published in: RAIRO - Theoretical Informatics and Applications
publication date: 1992-06-28T00:00:00Z
full work available at URL: https://eudml.org/doc/92398
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 36726
zbMATH Keywords: regular expression
zbMATH Keywords: minimal deterministic finite state automaton
zbMATH Keywords: language defined by a rational expression
zbMATH Keywords: infinite trees
zbMATH Keywords: Prolog
MaRDI profile type: Publication
OpenAlex ID: W122767979
cites work: The theory of languages
cites work: From regular expressions to deterministic automata
cites work: Derivatives of Regular Expressions
cites work: Parser generation and grammar manipulation using prolog's infinite trees
cites work: Q4729329
cites work: Fundamental properties of infinite trees
cites work: Q5536277
cites work: Programming Techniques: Regular expression search algorithm
DOI: 10.1051/ITA/1991250503971
Recommended article: Q3998008
Recommended article: Automata on infinite trees
Recommended article: Q3741087
Recommended article: Q3746905
Recommended article: Automata and Logics for Words and Trees over an Infinite Alphabet
Recommended article: On automata on infinite trees
Recommended article: Tree Automata over Infinite Alphabets
Recommended article: Semantics of infinite tree logic programming
Recommended article: Propositional Tree Automata
description: scientific article; zbMATH DE number 36726