Alternating finite automata and star-free languages
type: Item
instance of: scholarly article
title: Alternating finite automata and star-free languages
zbMATH Open document ID: 0944.68090
DOI: 10.1016/S0304-3975(98)00047-4
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1493454
zbMATH Keywords: finite automata
zbMATH Keywords: alternation
zbMATH Keywords: star-free languages
zbMATH Keywords: language equations
author: Kai Salomaa
author: Sheng Yu
MaRDI profile type: Publication
cites work: Derivatives of Regular Expressions
cites work: On equations for regular languages, finite automata, and sequential networks
cites work: Alternation
cites work: On the power of bounded concurrency I
cites work: Constructions for alternating finite automata∗
cites work: ON THE POWER OF ONE-WAY SYNCHRONIZED ALTERNATING MACHINES WITH SMALL SPACE
cites work: On communication-bounded synchronized alternating finite automata
cites work: Succinct representation of regular languages by Boolean automata
cites work: Succinct representation of regular languages by Boolean automata. II
cites work: Q5641083
cites work: A Note on Star-Free Events
cites work: Q4385527
cites work: On finite monoids having only trivial subgroups
cites work: Q4714446
Wikidata QID: Q127724572
Recommended article: Loop-free alternating finite automata
Recommended article: Q3334086
Recommended article: Alternating finite automata on \(\omega\)-words
Recommended article: Constructions for alternating finite automata∗
Recommended article: Q5009427
Recommended article: Characterization of Star-Connected Languages Using Finite Automata
Recommended article: Alternating finite automata with limited universal branching
Recommended article: Alternating automata with start formulas
Recommended article: An alternating hierarchy for finite automata
Recommended article: Finite Automata Accepting Star-Connected Languages
description: scientific article; zbMATH DE number 1493454