Construction of Tree Automata From Regular Expressions

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-85780-8_39
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Automatic Synthesis of Regular Expressions From Examples

Computer
Computer Science
2014English

Synchronization of Regular Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Object Oriented Regular Expressions

2008English

Explanations for Regular Expressions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Typeness for Ω-Regular Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Deciding Definability by Deterministic Regular Expressions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Automata in Categories and Regular Languages

Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
1984English

Derived-Term Automata of Multitape Expressions With Composition

Scientific Annals of Computer Science
Applied MathematicsComputer Science
2017English

Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1987English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy