Finite Automata on Unranked and Unordered DAGs
type: Item
instance of: scholarly article
title: Finite Automata on Unranked and Unordered DAGs
zbMATH Open document ID: 1202.68237
DOI: 10.1007/978-3-540-73208-2_33
author: Lutz Priese
published in: Developments in Language Theory
publication date: 2007-11-28T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5215387
zbMATH Keywords: finite state automata
zbMATH Keywords: directed acyclic graphs
zbMATH Keywords: regular dag languages
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-540-73208-2 33
OpenAlex ID: W2122646129
Recommended article: Fundamentals of Computation Theory
Recommended article: Q4995369
Recommended article: Term Rewriting and Applications
Recommended article: Automata for unordered trees
Recommended article: Finite automata with undirected state graphs
Recommended article: Structurally Unambiguous Finite Automata
Recommended article: Operations on Unambiguous Finite Automata
description: scientific article; zbMATH DE number 5215387