Vlad Rusu - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged automata theory

Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. ProceedingsAdrian Horia Dediu, Armand-Mihai Ionescu, Carlos Martín-Vide, editors, Volume 5457 of Lecture Notes in Computer Science, Springer, 2009. [doi]

1st International Conference on Language and Automata Theory and Applications (LATA 2007)Remco Loos, Carlos Martín-Vide. iandc, 206(9-10):1017, 2008. [doi]

Model-Based Test Selection for Infinite-State Reactive SystemsBertrand Jeannet, Thierry Jéron, Vlad Rusu. FMCO 2007: 47-69 [doi]

Tree Automata Make Ordinal Theory EasyThierry Cachat. fsttcs 2006: 285-296 [doi]

Understanding Basic Automata Theory in the Continuous Time SettingBoris A. Trakhtenbrot. FUIN, 62(1):69-121, 2004. [doi]

Adaptive Behavior in Cellular Automata Using Rough Set TheoryYasser Hassan, Eiichiro Tazaki. aai, 17(2):155-175, 2003. [doi]

Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure PropertiesKumar Neeraj Verma. RTA 2003: 180-196 [doi]

On Closure under Complementation of Equational Tree Automata for Theories Extending ACKumar Neeraj Verma. lpar 2003: 183-197 [doi]

Combinatorial Group Theory, Inverse Monoids, Automata, And Global Semigroup TheoryManuel Delgado, Stuart W. Margolis, Benjamin Steinberg. ijac, 12(1-2):179-211, 2002. [doi]

automata, a Hybrid System for Computational Automata TheoryKlaus Sutner. wia 2003: 221-227 [doi]

Beyond Regularity: Equational Tree Automata for Associative and Commutative TheoriesHitoshi Ohsaki. csl 2001: 539-553 [doi]

Undecidability and Incompleteness Results in Automata TheoryJuris Hartmanis. hcat 2000: 21-35

Timed Automata and the Theory of Real NumbersHubert Comon, Yan Jurski. concur 1999: 242-257 [doi]

Automata Theory for Reasoning About ActionsEugenia Ternovskaia. IJCAI 1999: 153-159

An Automata Theoretic Decidability Proof for First-Order Theory of <N, {<}, P> with Morphic Predicate PArnaud Maes. jalc, 4(3):229-246, 1999.

The Application of Cellular Automata to the Consumer s Theory: Simulating a Duopolistic MarketSobei H. Oda, Kouhei Iyori, Miura Ken, Kanji Ueda. seal 1999: 454-461 [doi]

The Automata Theory Package ::::omega::::Jens Vöge, S. Ulbrand, Oliver Matz, Nils Buhrke. wia 1998: 228-231

An Automata Theory Dedicated towards Formal Circuit SynthesisDirk Eisenbiegler, Ramayya Kumar. tphol 1995: 154-169

Tree Automata Help One To Solve Equational Formulae In AC-TheoriesDenis Lugiez, J. L. Moysset. JSC, 18(4):297-318, 1994.

Complement Problems and Tree Automata in AC-like Theories (Extended Abstract)Denis Lugiez, J. L. Moysset. STACS 1993: 515-524

A Formal Theory of Simulations between Infinite AutomataPaul Loewenstein. fmsd, 3(1/2):117-149, 1993.

A Formal Theory of Simulations Between Infinite AutomataPaul Loewenstein. tphol 1993: 227-246

Kleene Automata and Recursion TheoryJohn Mullins. lfcs 1992: 336-346

Euclidian Geometry in Terms of Automata TheoryUlrich Huckenbeck. TCS, 68(1):71-87, 1989.

Automata, Games, and Positive Monadic Theories of TreesMichel Parigot. fsttcs 1987: 44-57

Applications of the theory of automata in enumerationHoward Straubing. DM, 64(2-3):269-279, 1987. [doi]

Complexity of Some Problems from the Theory of AutomataJacques Stern. iandc, 66(3):163-176, September 1985.

Homology theories and tolerance automataM. W. Warner, A. Muir. DM, 33(2):209-221, 1981. [doi]

General theory of relational automataVera Trnková. FUIN, 3(2):189-234, 1980.

Nearly deterministic automata acceptation of infinite trees and a complexitiy of weak theory of SkSAndrzej Wlodzimierz Mostowski. caap 1980: 54-62

Categorical Theory of the Simulation of Automata and of Their Transition MonoidsDietmar Wätjen. eik, 14(5):233-249, 1978.

The Regulator Theory for Finite AutomataM. Gatto, G. Guardabassi. iandc, 31(1):1-16, May 1976.

Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, May 20-23, 1975H. Barkhage, editor, Volume 33 of Lecture Notes in Computer Science, Springer, 1975.

From Automata Theory to Brain TheoryMichael A. Arbib. ijmms, 7(3):279-295, 1975.

15th Annual Symposium on Switching and Automata Theory, 14-16 October 1974, The University of New Orleans, USAIEEE, 1974.

Finite Branching Automata: Automata Theory Motivated by Problem SolvingIvan M. Havel. mfcs 1975: 53-61

The Solution of Problems Relative to Probabilistic Automata in the Frame of the Formal Languages TheoryAlberto Bertoni. gi 1975: 107-112

Mathematical Methods of the Theory of Stochastic AutomataAlberto Bertoni. mfcs 1975: 9-22

13th Annual Symposium on Switching and Automata Theory, 25-27 October 1972, The University of Maryland, USAIEEE, 1972.

Conference Record 1971 Twelfth Annual Symposium on Switching and Automata Theory, 13-15 October 1971, East Lansing, Michigan, USAIEEE, 1971.

The use of Lists in the Study of Undecidable Problems in Automata TheoryJuris Hartmanis, Forbes D. Lewis. jcss, 5(1):54-66, 1971.

Conference Record of 1970 Eleventh Annual Symposium on Switching and Automata Theory, 28-30 October 1970, Santa Monica, California, USAIEEE, 1970.

Conference Record of 1969 Tenth Annual Symposium on Switching and Automata Theory, 15-17 October 1969, Waterloo, Ontario, CanadaIEEE, 1969.

On the Complexity of Undecidable Problems in Automata TheoryJuris Hartmanis. JACM, 16(1):160-167, 1969. [doi]

Conference Record of 1968 Ninth Annual Symposium on Switching and Automata Theory, 15-18 October 1968, Schenectady, New YorkIEEE, 1968.

Conference Record of 1967 Eighth Annual Symposium on Switching and Automata Theory, 18-20 October 1967, Austin, Texas, USAIEEE, 1967.

On the Complexity of Undecidable Problems in Automata TheoryJuris Hartmanis. focs 1967: 112-116

Conference Record of 1966 Seventh Annual Symposium on Switching and Automata Theory, 26-28 October 1966, Berkeley, California, USAIEEE, 1966.

On Asymptotic Estimates in Switching and Automata TheoryMichael A. Harrison. JACM, 13(1):151-157, 1966. [doi]

Automata theoryRichard Laing. CACM, 4(9):406, 1961. [doi]

runs on WebDSL