scispace - formally typeset
Search or ask a question
Topic

ω-automaton

About: ω-automaton is a research topic. Over the lifetime, 2299 publications have been published within this topic receiving 68468 citations. The topic is also known as: stream automaton & ω-automata.


Papers
More filters
Book
01 Jan 2013
TL;DR: The following automata have been studied: compressed automata, tree automata and XML streams.
Abstract: Complexity of automata.- Compressed automata.- Counter automata.- Dictionary matching.- Edit distance.- Homing sequences.- Implementation.- Minimization of automata.- Model checking.- Parsing of regular expressions.- Partial word automata.- Picture languages.- Pushdown automata.- Queue automata.- Reachability analysis for software verification.- Restarting automata.- Transducers.- Tree automata.- Weighted automata.- XML streams.

1 citations

Book ChapterDOI
24 Jul 2000
TL;DR: It is established that regularly extended two-way nondeterministic tree automata with unranked alphabets have the same expressive power as regularly extended nondeter determinants with un ranked alphABets.
Abstract: We establish that regularly extended two-way nondeterministic tree automata with unranked alphabets have the same expressive power as regularly extended nondeterministic tree automata with unranked alphabets. We obtain this result by establishing regularly extended versions of a congruence on trees and of a congruence on, so called, views. Our motivation for the study of these tree models is the Extensible Markup Language (XML), a metalanguage for defining document grammars. Such grammars have regular sets of right-hand sides for their productions and tree automata provide an alternative and useful modeling tool for them. In particular, we believe that they provide a useful computational model for what we call caterpillar expressions.

1 citations

Journal ArticleDOI
TL;DR: The problems of computing the automorphism group of automata, testing either two graphs, two strongly connected automata for isomorphism, or two Automata for strong-isomorphism are shown to be polynomially equivalent.
Abstract: A polynomial time algorithm for computing the automorphism group of cyclic automata is given The problems of computing the automorphism group of automata, testing either two graphs, two strongly connected automata for isomorphism, or two automata for strong-isomorphism are shown to be polynomially equivalent

1 citations

Journal ArticleDOI
TL;DR: It is shown that there exists an 2-state level 3 finite automaton with generalized acccptance, such that its equivalent minimal deterministic finite automata has more that 222 states.

1 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
88% related
Data structure
28.1K papers, 608.6K citations
83% related
Model checking
16.9K papers, 451.6K citations
83% related
Approximation algorithm
23.9K papers, 654.3K citations
82% related
Petri net
25K papers, 406.9K citations
82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20238
202219
20201
20191
20185
201748