General Algorithms for Testing the Ambiguity of Finite Automata
From MaRDI portal
Publication:3533003
DOI10.1007/978-3-540-85780-8_8zbMath1161.68507OpenAlexW1578526383MaRDI QIDQ3533003
Cyril Allauzen, Ashish Rastogi, Mehryar Mohri
Publication date: 30 October 2008
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_8
Related Items (7)
Queries on XML streams with bounded delay and concurrency ⋮ Bounded Delay and Concurrency for Earliest Query Answering ⋮ Filters for Efficient Composition of Weighted Finite-State Transducers ⋮ On Finite and Polynomial Ambiguity of Weighted Tree Automata ⋮ Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA ⋮ Consistently-detecting monitors ⋮ Memoized regular expressions
This page was built for publication: General Algorithms for Testing the Ambiguity of Finite Automata