| 2005 |
|---|
| 13 | EE | Florentin Ipate,
Tudor Balanescu:
Refinement in Finite State Machine Testing.
Fundam. Inform. 64(1-4): 191-203 (2005) |
| 2002 |
|---|
| 12 | EE | Tudor Balanescu,
Marian Gheorghe,
Mike Holcombe,
Florentin Ipate:
Eilenberg P Systems.
WMC-CdeA 2002: 43-57 |
| 11 | | Joaquin Aguado,
Tudor Balanescu,
Anthony J. Cowling,
Marian Gheorghe,
Mike Holcombe,
Florentin Ipate:
P Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines).
Fundam. Inform. 49(1-3): 17-33 (2002) |
| 2001 |
|---|
| 10 | EE | Tudor Balanescu,
Marian Gheorghe,
Mike Holcombe,
Florentin Ipate:
Testing Collaborative Agents Defined as Stream X-Machines with Distributed Grammars.
ECAL 2001: 296-305 |
| 9 | | Florentin Ipate,
Marian Gheorghe,
Mike Holcombe,
Tudor Balanescu:
Testing Using X-Machine Translations.
Words, Semigroups, and Transductions 2001: 211-229 |
| 2000 |
|---|
| 8 | | Mike Holcombe,
Tudor Balanescu,
Marian Gheorghe,
Paul Radovici-Marculescu:
On Testing Generalized Stream X-Machines.
Recent Topics in Mathematical and Computational Linguistics 2000: 130-141 |
| 7 | EE | Tudor Balanescu:
Generalised Stream X-Machines with Output Delimited Type.
Formal Asp. Comput. 12(6): 473-484 (2000) |
| 1999 |
|---|
| 6 | | Tudor Balanescu,
Horia Georgescu,
Marian Gheorghe:
A New Type of Counting Derivation for CD Grammar Systems.
Grammatical Models of Multi-Agent Systems 1999: 1-17 |
| 5 | EE | Tudor Balanescu,
Anthony J. Cowling,
Horia Georgescu,
Marian Gheorghe,
Mike Holcombe,
Cristina Vertan:
Communicating Stream X-Machines Systems are no more than X-Machines.
J. UCS 5(9): 494-507 (1999) |
| 1998 |
|---|
| 4 | | Tudor Balanescu,
Horia Georgescu,
Marian Gheorghe:
Grammatical Models for Some Process Synchronizers.
MFCS Workshop on Grammar Systems 1998: 117-137 |
| 1997 |
|---|
| 3 | | Tudor Balanescu,
Horia Georgescu,
Marian Gheorghe:
Grammar Systems with Counting Derivation and Dynamical Priorities.
New Trends in Formal Languages 1997: 150-166 |
| 1991 |
|---|
| 2 | | Tudor Balanescu,
Marian Gheorghe:
A note on PF(k) - parsable languages.
Fundam. Inform. 14(3): 283-286 (1991) |
| 1984 |
|---|
| 1 | | Tudor Balanescu:
A proof rule for the "it it" generalized control structure.
Bulletin of the EATCS 24: 48-52 (1984) |
